Algebraic Computability and Enumeration Models

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.

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.