On hypercomputation, universal and diagonalization complete problems

DOI10.3233/FI-2015-1237MaRDI QIDQ2805471zbMATH OpenOpenAlexFDO

Authors Eugene Eberbach

Publication date 11 May 2016

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2015-1237

zbMATH Keywords

\(\mathcal{D}\)-completeness\(\mathcal{H}\)-completeness\(\mathcal{U}\)-completeness\$-calculusa-decidabilitye-decidabilityhypercomputationi-decidabilityp-decidabilityproblem solvingundecidability

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 4031659
• Generic complexity of undecidable problems
• The Diagonal Method and Hypercomputation
• Hypercomputation: Philosophical issues
• Generic Complexity of Undecidable Problems

Cited in

(3)

• Generic complexity of undecidable problems
• Diagonalisation and Church's Thesis: Kleene's Homework
• On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus

This page was built for publication: On hypercomputation, universal and diagonalization complete problems

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