Computability and realizability for interactive computations
Author:
- Manfred BroyMBManfred Broy
- 1 April 2015
- journal article
- Published by Elsevier in Information and Computation
- Vol. 241, 277-301
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Turing machines, transition systems, and interactionInformation and Computation, 2004
- Why Church's Thesis Still Holds. Some Notes on Peter Wegner's Tracts on Interaction and ComputabilityThe Computer Journal, 1998
- Adding fair choice to Dijkstra's calculusACM Transactions on Programming Languages and Systems, 1994
- Composing specificationsACM Transactions on Programming Languages and Systems, 1993
- Elements of interactionCommunications of the ACM, 1993
- On the complexity of ω-type Turing acceptorsTheoretical Computer Science, 1980
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978
- ω-Computations on Turing machinesTheoretical Computer Science, 1978
- Theory of ω-languages. II: A study of various models of ω-type generation and recognitionJournal of Computer and System Sciences, 1977
- An Unsolvable Problem of Elementary Number TheoryAmerican Journal of Mathematics, 1936