Interactive Computation
From MaRDI portal
Publication:5394323
DOI10.1007/3-540-34874-3zbMath1106.68002OpenAlexW4232617586MaRDI QIDQ5394323
No author found.
Publication date: 27 October 2006
Full work available at URL: https://doi.org/10.1007/3-540-34874-3
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 artificial intelligence (68T01) General topics in the theory of computing (68Q01)
Related Items (18)
What is the Church-Turing Thesis? ⋮ On the Executability of Interactive Computation ⋮ The Computational Power of Interactive Recurrent Neural Networks ⋮ Rough sets: past, present, and future ⋮ Some Foundational Aspects of Rough Sets Rendering Its Wide Applicability ⋮ How We Think of Computing Today ⋮ The expressive power of analog recurrent neural networks on infinite input streams ⋮ Build your own clarithmetic I: Setup and completeness ⋮ Information flow in logic for distributed systems: extending graded consequence ⋮ Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography ⋮ \(p\)-adic physics, non-well-founded reality and unconventional computing ⋮ On Compiling Structured Interactive Programs with Registers and Voices ⋮ Interactive computations: toward risk management in interactive intelligent systems ⋮ Notes on spiking neural P systems and finite automata ⋮ Turing oracle machines, online computing, and three displacements in computability theory ⋮ Professor Zdzisław Pawlak (1926-2006): Founder of the Polish School of Artificial Intelligence ⋮ Rough Sets: From Rudiments to Challenges ⋮ Programming Languages For Interactive Computing
This page was built for publication: Interactive Computation
