Computability and realizability for interactive computations
From MaRDI portal
Publication:2343137
DOI10.1016/j.ic.2014.12.019zbMath1309.68064MaRDI QIDQ2343137
Publication date: 4 May 2015
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2014.12.019
Related Items
What is the Church-Turing Thesis?, Specification and verification of concurrent systems by causality and realizability, Theory and methodology of assumption/commitment based system interface specification and architectural contracts
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Turing machines, transition systems, and interaction
- On the complexity of \(\omega\)-type Turing acceptors
- Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition
- \(\omega\)-computations on Turing machines
- Verification of concurrent programs: The automata-theoretic framework
- Specification and Development of Interactive Systems
- Data Types as Lattices
- Time, clocks, and the ordering of events in a distributed system
- Why Church's Thesis Still Holds. Some Notes on Peter Wegner's Tracts on Interaction and Computability
- A Theory of System Interaction: Components, Interfaces, and Services
- A Theory of Interactive Computation
- Computability Logic: A Formal Theory of Interaction
- Interaction and Realizability
- Church’s Problem and a Tour through Automata Theory
- New Computational Paradigms
