Interactive Computation

DOI10.1007/3-540-34874-3MaRDI QIDQ5394323zbMATH OpenOpenAlexFDO

Authors

Publication date 27 October 2006

Full work available at URL https://doi.org/10.1007/3-540-34874-3

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) General topics in the theory of computing (68Q01) General topics in artificial intelligence (68T01)

Recommendations

• Computing and interaction
• scientific article; zbMATH DE number 1759503
• Notes on interaction and Turing-computability
• Interactive computation: stepping stone in the pathway from classical to developmental computation
• Theory of interaction

Cited in

(25)

• Turing oracle machines, online computing, and three displacements in computability theory
• p-adic physics, non-well-founded reality and unconventional computing
• Information flow in logic for distributed systems: extending graded consequence
• Interactive computations: toward risk management in interactive intelligent systems
• Notes on spiking neural P systems and finite automata
• Interactive computation: stepping stone in the pathway from classical to developmental computation
• Programming languages for interactive computing
• The computational power of interactive recurrent neural networks
• Build your own clarithmetic. I: Setup and completeness
• On the executability of interactive computation
• Information and computation. Essays on scientific and philosophical understanding of foundations of information and computation
• How We Think of Computing Today
• The expressive power of analog recurrent neural networks on infinite input streams
• Computing and interaction
• Principles of interactive computation
• What is the Church-Turing Thesis?
• Obituary: Professor Zdzisław Pawlak (1926--2006): founder of the Polish School of Artificial Intelligence
• Rough Sets: From Rudiments to Challenges
• On Compiling Structured Interactive Programs with Registers and Voices
• scientific article; zbMATH DE number 2193956 (Why is no real title available?)
• Rough sets: past, present, and future
• Some Foundational Aspects of Rough Sets Rendering Its Wide Applicability
• Thoughts on sub-Turing interactive computability
• Theory of interaction
• Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography

This page was built for publication: Interactive Computation

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