The applicability of \$-calculus to solve some Turing machine undecidable problems

MaRDI QIDQ4682579zbMATH OpenFDO

Authors Eugene Eberbach

Publication date 18 September 2018

zbMATH Keywords

\$-calculusexpressivenesshypercomputationproblem solvingprocess algebrasresource bounded computationsuperTuring models of computation

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Undecidability and degrees of sets of sentences (03D35) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
• scientific article; zbMATH DE number 1531818
• X-machines and the halting problem: Building a super-turing machine
• \$-calculus of bounded rational agents: flexible optimization as search under bounded resources in interactive systems
• Super-tasks, accelerating Turing machines and uncomputability

Cited in

(4)

• The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
• scientific article; zbMATH DE number 732055 (Why is no real title available?)
• scientific article; zbMATH DE number 1531818 (Why is no real title available?)
• \$-calculus of bounded rational agents: flexible optimization as search under bounded resources in interactive systems

This page was built for publication: The applicability of \$-calculus to solve some Turing machine undecidable problems

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