On algorithms and interaction

DOI10.1007/3-540-44612-5_7MaRDI QIDQ4536346zbMATH OpenFDO

Authors J. Van Leeuwen, Jiří Wiedermann

Publication date 4 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44612-5_7

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Algorithm theories and design tactics
• Algorithms and their explanations
• Algorithms, games, and the internet

Cited in

(16)

• Interactive foundations of computing
• A thesis for interaction
• Computability and realizability for interactive computations
• Notes on interaction and Turing-computability
• Reactive Turing machines
• On the executability of interactive computation
• Why Church's Thesis Still Holds. Some Notes on Peter Wegner's Tracts on Interaction and Computability
• On the power of interactive computing
• A Note on Interaction and Incompleteness
• Turing machines, transition systems, and interaction
• Principles of interactive computation
• A theory of interactive computation
• Interactive Algorithms 2005 with Added Appendix
• Interaction and Realizability
• Mathematical Foundations of Computer Science 2005
• Expressive power of first-order recurrent neural networks determined by their attractor dynamics

This page was built for publication: On algorithms and interaction

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