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

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Cyrus F. Nourani
310 pages
Apple Academic Press
Feb 2016
Hardcover
Science WSBN
0
Readers
0
Reviews
0
Discussions
0
Quotes
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
Join the conversation

No discussions yet. Join BookLovers to start a discussion about this book!

No reviews yet. Join BookLovers to write the first review!

No quotes shared yet. Join BookLovers to share your favorite quotes!

Earn Points
Your voice matters. Every comment, review, and quote earns you reward points redeemable for Bitcoin.
Comment +5 pts Review +20 pts Quote +7 pts Upvote +1 pt
BookMatch Quiz
Find books similar to this one
About this book
Pages 310
Publisher Apple Academic Press
Published 2016
Readers 0