Turing's work relies on Cantor's contributions; a new undecidability measure and U-complete, D-complete, H-complete classes are defined, with a negative answer to a P-vs-NP analog for undecidable problems.
On Completeness of Cost Metrics and Meta-Search Algo- rithms in $-Calculus, Fundamenta Informaticae, IOS Press, 188(2):63- 90(2022), https://doi.org.10.3233/FI-222142
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Turing or Cantor: That is the Question
Turing's work relies on Cantor's contributions; a new undecidability measure and U-complete, D-complete, H-complete classes are defined, with a negative answer to a P-vs-NP analog for undecidable problems.