Recursion Theory and Computational Complexity

✍ Scribed by Steve Homer (auth.), G. Lolli (eds.)

Publisher: Springer-Verlag Berlin Heidelberg
Year: 2011
Tongue: English
Leaves: 227
Series: C.I.M.E. Summer Schools 79
Edition: 1
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

S. Homer: Admissible recursion theory.- B.E. Jacobs: Computational complexity and recursion theory.- D. Normann: A survey of set recursion.- G.E. Sacks: Priority arguments in Higgler recursion.- R.I. Soare: Construction in the recursively enumerable degrees.- W. Maass: Recursively invariant recursion theory.

✦ Table of Contents

Front Matter....Pages i-iii
Admissible Recursion Theory....Pages 5-28
Computational Complexity and Recursion Theory....Pages 29-98
A Survey of Set Recursion....Pages 99-106
Priority Arguments in Higher Recursion Theory....Pages 107-168
Constructions in the Recursively Enumerable Degrees....Pages 169-225
Recursively Invariant -Recursion Theory....Pages 227-240

✦ Subjects

Mathematical Logic and Foundations

📜 SIMILAR VOLUMES

Recursion Theory and Computational Compl

📁 Recursion Theory and Computational Complexity

✍ Steve Homer (auth.), G. Lolli (eds.) 📂 Library 📅 2011 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

<p>S. Homer: Admissible recursion theory.- B.E. Jacobs: Computational complexity and recursion theory.- D. Normann: A survey of set recursion.- G.E. Sacks: Priority arguments in Higgler recursion.- R.I. Soare: Construction in the recursively enumerable degrees.- W. Maass: Recursively invariant recur

Complexity, logic, and recursion theory

📁 Complexity, logic, and recursion theory

✍ Sorbi, Andrea 📂 Library 📅 2019 🏛 CRC Press 🌐 English

"Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretical computer science. Presents new, never-before-published results and provides informtion not easily accessible in the literature."</div> <

Complexity, logic, and recursion theory

📁 Complexity, logic, and recursion theory

✍ Andrea Sorbi 📂 Library 📅 1997 🏛 CRC Press 🌐 English

Complexity, logic, and recursion theory

📁 Complexity, logic, and recursion theory

✍ Andrea Sorbi 📂 Library 📅 1997 🏛 CRC Press 🌐 English

Integrating two classical approaches to computability, this timely reference offers detailed coverage of recent research at the interface of logic, computability theory, and theoretical computer science. Presents new, never-before-published results and provides information not easily accessible in t

Algebraic computability and enumeration

📁 Algebraic computability and enumeration models: recursion theory and descriptive complexity

✍ Nourani, Cyrus F 📂 Library 📅 2016 🏛 Apple Academic Press;CRC 🌐 English

"This book, Computability, Algebraic Trees, Enumeration Degree Models, and Applications, presents new techniques with functorial models to address important areas on pure mathematics and computability theory from the algebraic view point. The reader is first introduced to categories and functorial m

Algebraic computability and enumeration

📁 Algebraic computability and enumeration models : recursion theory and descriptive complexity

✍ Nourani, Cyrus F. 📂 Library 📅 2016 🏛 Apple Academic Press 🌐 English