scientific article; zbMATH DE number 1531818

MaRDI QIDQ4513849zbMATH OpenFDO

Authors Eugene Eberbach

Publication date 19 November 2000

zbMATH Keywords

\$-calculushigher-order polyadic process algebra

Mathematics Subject Classification ID

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

Recommendations

• \$-calculus of bounded rational agents: flexible optimization as search under bounded resources in interactive systems
• The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
• The applicability of \$-calculus to solve some Turing machine undecidable problems
• On the expressiveness of interaction
• On the expressive power of polyadic synchronisation in -calculus

Cited in

(4)

• The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
• The applicability of \$-calculus to solve some Turing machine undecidable problems
• \$-calculus of bounded rational agents: flexible optimization as search under bounded resources in interactive systems
• Approximate reasoning in the algebra of bounded rational agents

This page was built for publication:

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