๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

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

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


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
โœ 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

Recursion Theory and Computational Compl
โœ 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

Recursion Theory and Computational Compl
โœ 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