Algebraic Computability and Enumeration Models
Recursion Theory and Descriptive Complexity
1st Edition
Published on 31. March 2021
Book
Paperback/Softback
310 pages
978-1-77463-575-9 (ISBN)
Description
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 for languages. Functorial models for Peano arithmetic are described toward important computational complexity areas on a Hilbert program, leading to computability with initial models. Infinite language categories are also introduced to explain descriptive complexity with recursive computability with admissible sets and urelements.
Algebraic and categorical realizability is staged on several levels, addressing new computability questions with omitting types realizably. Further applications to computing with ultrafilters on sets and Turing degree computability are examined. Functorial models computability is presented with algebraic trees realizing intuitionistic types of models. New homotopy techniques are applied to Marin Lof types of computations with model categories. Functorial computability, induction, and recursion are examined in view of the above, presenting new computability techniques with monad transformations and projective sets.
This informative volume will give readers a complete new feel for models, computability, recursion sets, complexity, and realizability. This book pulls together functorial thoughts, models, computability, sets, recursion, arithmetic hierarchy, filters, with real tree computing areas, presented in a very intuitive manner for university teaching, with exercises for every chapter. The book will also prove valuable for faculty in computer science and mathematics.
Algebraic and categorical realizability is staged on several levels, addressing new computability questions with omitting types realizably. Further applications to computing with ultrafilters on sets and Turing degree computability are examined. Functorial models computability is presented with algebraic trees realizing intuitionistic types of models. New homotopy techniques are applied to Marin Lof types of computations with model categories. Functorial computability, induction, and recursion are examined in view of the above, presenting new computability techniques with monad transformations and projective sets.
This informative volume will give readers a complete new feel for models, computability, recursion sets, complexity, and realizability. This book pulls together functorial thoughts, models, computability, sets, recursion, arithmetic hierarchy, filters, with real tree computing areas, presented in a very intuitive manner for university teaching, with exercises for every chapter. The book will also prove valuable for faculty in computer science and mathematics.
Reviews / Votes
One of the 14 Best-Selling Recursion Theory eBooks of All Time by BookAuthorityMore details
Language
English
Place of publication
Oakville
Canada
Target group
College/higher education
Professional and scholarly
Academic and Postgraduate
Dimensions
Height: 229 mm
Width: 152 mm
Thickness: 17 mm
Weight
452 gr
ISBN-13
978-1-77463-575-9 (9781774635759)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Cyrus F. Nourani
Algebraic Computability and Enumeration Models
Recursion Theory and Descriptive Complexity
Book
02/2016
1st Edition
Apple Academic Press Inc.
€210.10
Shipment within 3-4 weeks
Cyrus F. Nourani
Algebraic Computability and Enumeration Models
Recursion Theory and Descriptive Complexity
E-Book
02/2016
Apple Academic Press Inc.
€185.99
Available for download
Person
Dr. Cyrus F. Nourani has a national and international reputation in computer science, artificial intelligence, mathematics, virtual haptic computation, information technology, and management. He has many years of experience in the design and implementation of computing systems. Dr. Nourani's academic experience includes faculty positions at the University of Michigan-Ann Arbor, the University of Pennsylvania, the University of Southern California, UCLA, MIT, and the University of California, Santa Barbara. He was also research professor at Simon Frasier University in Burnaby, British Columbia, Canada. He was a visiting professor at Edith Cowan University, Perth, Australia, and a lecturer of management science and IT at the University of Auckland, New Zealand.
Dr. Nourani commenced his university degrees at MIT where he became interested in algebraic semantics. That was pursued with a category theorist at the University of California. Dr. Nourani's dissertation on computing models and categories proved to have intuitionist forcing developments that were published from his postdoctoral times on at ASL. He has taught AI to the Los Angeles aerospace industry and has authored many R&D and commercial ventures. He has written and co-authored several books. He has over 350 publications in mathematics and computer science and has written on additional topics, such as pure mathematics, AI, EC, and IT management science, decision trees, predictive economics game modeling. In 1987, he founded Ventures for computing R&D. He began independent consulting with clients such as System Development Corporation (SDC), the US Air Force Space Division, and GE Aerospace. Dr. Nourani has designed and developed AI robot planning and reasoning systems at Northrop Research and Technology Center, Palos Verdes, California. He also has comparable AI, software, and computing foundations and R&D experience at GTE Research Labs.
Dr. Nourani commenced his university degrees at MIT where he became interested in algebraic semantics. That was pursued with a category theorist at the University of California. Dr. Nourani's dissertation on computing models and categories proved to have intuitionist forcing developments that were published from his postdoctoral times on at ASL. He has taught AI to the Los Angeles aerospace industry and has authored many R&D and commercial ventures. He has written and co-authored several books. He has over 350 publications in mathematics and computer science and has written on additional topics, such as pure mathematics, AI, EC, and IT management science, decision trees, predictive economics game modeling. In 1987, he founded Ventures for computing R&D. He began independent consulting with clients such as System Development Corporation (SDC), the US Air Force Space Division, and GE Aerospace. Dr. Nourani has designed and developed AI robot planning and reasoning systems at Northrop Research and Technology Center, Palos Verdes, California. He also has comparable AI, software, and computing foundations and R&D experience at GTE Research Labs.
Content
Preface. Introduction. Computing Categories, Language Fragments, and Models. Functorial Admissible Models. Initial Tree Computing and Languages. Descriptive Sets and Infinitary Languages. Complexity and Computing. Arithmetic Hierarchy and Enumeration Degrees. Peano Arithmetic Models and Computability. Realizability and Computability. Index.