Approximations to the halting problem

DOI10.1016/S0022-0000(74)80003-6zbMath0299.02042MaRDI QIDQ1214917

Nancy A. Lynch

Publication date: 1974

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Word problems, etc. in computability and recursion theory (03D40) Recursively (computably) enumerable sets and degrees (03D25) Turing machines and related notions (03D10)

Related Items (4)

What Percentage of Programs Halt? ⋮ A MINIMAL PAIR IN THE GENERIC DEGREES ⋮ Some Questions in Computable Mathematics ⋮ Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega

Cites Work

• Optimal enumerations and optimal gödel numberings
• Unnamed Item

This page was built for publication: Approximations to the halting problem