\$-calculus of bounded rational agents: flexible optimization as search under bounded resources in interactive systems

MaRDI QIDQ5472885zbMATH OpenFDO

Authors Eugene Eberbach

Publication date 19 June 2006

zbMATH Keywords

problem solvingprocess algebraresource bounded computation

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1531818
• The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
• Approximate reasoning in the algebra of bounded rational agents
• The applicability of \$-calculus to solve some Turing machine undecidable problems
• A calculus for costed computations

Cited in

(7)

• The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
• BRA: an algorithm for simulating bounded rational agents
• Resource-Adaptive Model Generation as a Performance Model
• scientific article; zbMATH DE number 1531818 (Why is no real title available?)
• The applicability of \$-calculus to solve some Turing machine undecidable problems
• On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus
• Approximate reasoning in the algebra of bounded rational agents

This page was built for publication: \$-calculus of bounded rational agents: flexible optimization as search under bounded resources in interactive systems

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