The non-recursive power of erroneous computation

DOI10.1007/3-540-46691-6_32MaRDI QIDQ4501685zbMATH OpenFDO

Authors Christian Schindelhauer, Andreas Jakoby

Publication date 7 November 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46691-6_32

zbMATH Keywords

complexity classes

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Learning classes of approximations to non-recursive functions.
• A new algorithm design technique for hard problems, building on methods of complexity theory
• Kolmogorov Complexity with Error
• scientific article; zbMATH DE number 3877163
• Category and Measure in Complexity Classes

Cited in

(3)

• What percentage of programs halt?
• A new algorithm design technique for hard problems, building on methods of complexity theory
• scientific article; zbMATH DE number 7701440 (Why is no real title available?)

This page was built for publication: The non-recursive power of erroneous computation

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