scientific article; zbMATH DE number 2080910

MaRDI QIDQ4473975zbMATH OpenFDO

Authors J. Van Leeuwen, Jiří Wiedermann

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2234/22340090.htm

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Theory Is Forever
• scientific article; zbMATH DE number 2044631
• Intelligent and evolutionary systems
• Towards creative evolutionary systems with interactive genetic algorithm
• scientific article; zbMATH DE number 1900795
• Advances in the evolutionary synthesis of intelligent agents

Cited in

(16)

• Short variable length domain extenders with beyond birthday bound security
• State separation for code-based game-playing proofs
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Autopoietic automata: complexity issues in offspring-producing evolving processes
• Question answering by humans and machines: a complexity-theoretic view
• Notes on interaction and Turing-computability
• Interactive computation: stepping stone in the pathway from classical to developmental computation
• Interaction and collective intelligence on the internet
• Towards “Fypercomputations” (in Membrane Computing)
• On the executability of interactive computation
• How We Think of Computing Today
• Reactive Turing machines
• The expressive power of analog recurrent neural networks on infinite input streams
• scientific article; zbMATH DE number 1759503 (Why is no real title available?)
• Theory Is Forever
• Formalizing the notions of non-interactive and interactive algorithms

This page was built for publication:

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