Recursive Undecidability--An Exposition

DOI10.2307/2319560zbMath0326.02034OpenAlexW4234640904MaRDI QIDQ4090320

James P. Jones

Publication date: 1974

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2319560

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Decidability of theories and sets of sentences (03B25) Turing machines and related notions (03D10)

Related Items (4)

Register machine proof of the theorem on exponential diophantine representation of enumerable sets ⋮ Expository notes on computability and complexity in (arithmetical) games ⋮ Some undecidable determined games ⋮ A survey of computational complexity results in systems and control

This page was built for publication: Recursive Undecidability--An Exposition