On Hypercomputation, Universal and Diagonalization Complete Problems

DOI10.3233/FI-2015-1237zbMath1357.68056OpenAlexW2294753125MaRDI QIDQ2805471

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

undecidabilityproblem solvinghypercomputation\$-calculus\(\mathcal{D}\)-completeness\(\mathcal{H}\)-completeness\(\mathcal{U}\)-completenessa-decidabilitye-decidabilityi-decidabilityp-decidability

Mathematics Subject Classification ID

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

Related Items (1)

On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus

This page was built for publication: On Hypercomputation, Universal and Diagonalization Complete Problems