On the strongly generic undecidability of the halting problem
From MaRDI portal
Publication:884482
DOI10.1016/J.TCS.2007.02.010zbMATH Open1118.03033OpenAlexW1983360706MaRDI QIDQ884482FDOQ884482
Publication date: 6 June 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.010
Cites Work
Cited In (8)
- Generic amplification of recursively enumerable sets
- A Parameterized Halting Problem
- Asymptotic density, immunity and randomness
- The origins of the halting problem
- The generic complexity of the bounded problem of graphs clustering
- On the generic undecidability of the halting problem for normalized Turing machines
- Generic complexity of undecidable problems
- The generic complexity of the graph triangulation problem
Recommendations
- Title not available (Why is that?) π π
- Generic complexity of undecidable problems π π
- Undecidability and intuitionistic incompleteness π π
- Strong nondeterministic Turing reduction - a technique for proving intractability π π
- Formalization of the undecidability of the halting problem for a functional language π π
- On the generic undecidability of the halting problem for normalized Turing machines π π
- Generic Complexity of Undecidable Problems π π
- Undecidability in Some Structures Related to Computation Theory π π
- Some undecidability results in strong algebraic languages π π
- DECIDABILITY AND UNIVERSALITY IN THE AXIOMATIC THEORY OF COMPUTABILITY AND ALGORITHMS π π
This page was built for publication: On the strongly generic undecidability of the halting problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q884482)