Recursive Undecidability--An Exposition

DOI10.2307/2319560MaRDI QIDQ4090320zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4090320)