Turing machines associated with the undecidability property of the halting problem

DOI10.1023/A:1015840005656zbMath1029.03026OpenAlexW91167006MaRDI QIDQ1810121

L. M. Pavlotskaya

Publication date: 15 June 2003

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1015840005656

zbMATH Keywords

decidabilityTuring machinehalting problem

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25) Turing machines and related notions (03D10)

This page was built for publication: Turing machines associated with the undecidability property of the halting problem