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

DOI10.3233/FI-222142arXiv2106.15969OpenAlexW3173495721MaRDI QIDQ6040672

Eugene Eberbach

Publication date: 19 May 2023

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.15969

zbMATH Keywords

undecidabilityrecursive algorithmsreduction techniquesautomatic programming\$-calculusa-decidabilitye-decidabilityi-decidabilityp-decidabilitysuper-recursive algorithmssuper-Turing computationD-completenessH-completenessautomatic problem solvingcost metrics completenessintractablitymeta-search algorithms completenessnon-recursively enumerable algorithmsrecursively enumerable but not recursive algorithmsU-completeness

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate reasoning in the algebra of bounded rational agents
• The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
• On Hypercomputation, Universal and Diagonalization Complete Problems
• Alan Turing: Life and Legacy of a Great Thinker
• Super-Recursive Algorithms
• Hypercomputation
• On Non-Computable Functions
• On Computable Numbers, with an Application to the Entscheidungsproblem
• A variant of a recursively unsolvable problem

This page was built for publication: On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus