Complexity, logic, and recursion theory
β Andrea Sorbi
π Library
π
1997
π CRC Press
π English
β¦ LIBER β¦
π
Complexity, logic, and recursion theory
β Scribed by Sorbi, Andrea
- Publisher
- CRC Press
- Year
- 2019
- Tongue
- English
- Leaves
- 380
- Series
- Lecture notes in pure and applied mathematics 187
- Category
- Library
β¬ Acquire This Volume
No coin nor oath required. For personal study only.
β¦ Synopsis
"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."
Abstract: "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."
β¦ Table of Contents
Content: Cover
Half Title
Title Page
Copyright Page
Preface
Table of Contents
Contributors
Resource-Bounded Measure and Randomness
Degree Structures in Local Degree Theory
Compressibility of Infinite Binary Sequences
Beyond GoΜdel's Theorem: The Failure to Capture Information Content
Progressions of Theories of Bounded Arithmetic
On Presentations of Algebraic Structures
Witness-Isomorphic Reductions and Local Search
A Survey of Inductive Inference with an Emphasis on Queries
A Uniformity of Degree Structures
Short Course on Logic, Algebra, and Topology
β¦ Subjects
Computational complexity;Recursion theory;MATHEMATICS / General;MATHEMATICS / Applied
π SIMILAR VOLUMES
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
Recursive function theory and logic
β Ann Yasuhara
π Library
π
1971
π Academic Press
π English
Bounded arithmetic, propositional logic
β Jan Krajicek
π Library
π
1995
π Cambridge University Press
π English