Complexity of evolving interactive systems

DOI10.1007/978-3-540-27812-2_24MaRDI QIDQ5894884zbMATH OpenOpenAlexFDO

Authors Peter Verbaan, J. Van Leeuwen, Jiří Wiedermann

Publication date 18 January 2005

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

Full work available at URL https://doi.org/10.1007/b98751

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45)

Recommendations

• Beyond the Turing limit: Evolving interactive systems
• Autopoietic automata: complexity issues in offspring-producing evolving processes
• How We Think of Computing Today
• Membrane Computing
• A theory of interactive computation

Cited in

(6)

• Autopoietic automata: complexity issues in offspring-producing evolving processes
• How We Think of Computing Today
• scientific article; zbMATH DE number 4081374 (Why is no real title available?)
• Beyond the Turing limit: Evolving interactive systems
• scientific article; zbMATH DE number 6747919 (Why is no real title available?)
• Large language models and the extended Church-Turing thesis

This page was built for publication: Complexity of evolving interactive systems

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