The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems

DOI10.1016/j.tcs.2007.04.012zbMath1124.68069OpenAlexW2120607043MaRDI QIDQ2383594

Eugene Eberbach

Publication date: 19 September 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.04.012

zbMATH Keywords

undecidabilityoptimalitycompletenessproblem solvinganytime algorithmsintractabilityprocess algebrasbounded rational agentstotal optimality\$-calculussearch optimalitysuper-Turing models of computation

Mathematics Subject Classification ID

Related Items (4)

On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus ⋮ A full process algebraic representation of ant colony optimization ⋮ Employing Costs in Multiagent Systems with Timed Migration and Timed Communication ⋮ THE MYTH OF 'THE MYTH OF HYPERCOMPUTATION'

Cites Work

• Interactive foundations of computing
• A calculus of communicating systems
• A calculus of mobile processes. II
• A study of drift analysis for estimating computation time of evolutionary algorithms
• Super-Recursive Algorithms
• New Models of Computation
• Turing Machines, Transition Systems, and Interaction
• Systems of Logic Based on Ordinals^†
• A variant of a recursively unsolvable problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems