Complexity, Logic, and Recursion Theory
id: 1137840 not VIP
Open in MaM
By Andrea Sorbi, Zuhair Nashed, Earl Taft
Language: English
Category: Ebook - Math/Science/Tech
Categories: Science
Uploader: humblebeepbeep
Uploaded At: 2025-04-18 04:53:30
2019, Randomness, Logic, Topology, Bounded Arithmetic, Gödel's Incompleteness Theorem, Provability, Turing Compatibility
Description
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 information not easily accessible in the literature.