Algebraic Computability and Enumeration Models : Recursion Theory and Descriptive Complexity - Cyrus F. Nourani

eTEXT

Algebraic Computability and Enumeration Models

Recursion Theory and Descriptive Complexity

By: Cyrus F. Nourani

eText | 24 February 2016 | Edition Number 1

At a Glance

eText


$173.80

or 4 interest-free payments of $43.45 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Read online on
Desktop
Tablet
Mobile

Not downloadable to your eReader or an app

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
This book, Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity, presents new techniques with functorial models to address important areas on pure mathematics and computability theory from the algebraic viewpoint. The reader is first introduced to categories and functorial models, with Kleene algebra examples
Read online on
Desktop
Tablet
Mobile

Other Editions and Formats

Paperback

Published: 31st March 2021

More in Algebra

Mathematics for Engineers - Francesc Pozo Montero

eTEXT