"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
โ Scribed by Andrea Sorbi
- Publisher
- CRC Press
- Year
- 1997
- Tongue
- English
- Leaves
- 366
- Series
- Lecture Notes in Pure and Applied Mathematics
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
<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
<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