Computable concurrent processes

DOI10.1016/0304-3975(94)00117-2zbMath0874.68112OpenAlexW2023146962MaRDI QIDQ673972

Yiannis N. Moschovakis

Publication date: 28 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00117-2

zbMATH Keywords

relative computability

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (2)

Computable concurrent processes ⋮ A model of concurrency with fair merge and full recursion

Cites Work

• Computable concurrent processes
• A model of concurrency with fair merge and full recursion
• A theory for nondeterminism, parallelism, communication, and concurrency
• Algebraic and fixed point equations over inverse limits of algebras
• Power domains
• The formal language of recursion
• A Powerdomain Construction
• Programming as a Discipline of Mathematical Nature
• 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: Computable concurrent processes