Complexity, Logic and Recursion Theory / Edition 1 available in Paperback
- Pub. Date:
- Taylor & Francis
"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."
|Publisher:||Taylor & Francis|
|Series:||Lecture Notes in Pure and Applied Mathematics Series|
|Product dimensions:||6.25(w) x 9.25(h) x 3.50(d)|
Table of ContentsResource-bounded measure and randomness; degree structures in local degree theory; compressibility of infinite binary sequences; beyond Godel'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; the convenience of Tiling. (Part contents).