Beyond the Turing limit: Evolving interactive systems
From MaRDI portal
Recommendations
- Theory Is Forever
- Interactive evolutionary computation as humanized computational intelligence technology
- Intelligent and evolutionary systems
- Towards creative evolutionary systems with interactive genetic algorithm
- Emergence of a super-Turing computational potential in artificial living systems. (Extended abstract)
- 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
- On the power of interactive computing
- Theory Is Forever
- Formalizing the notions of non-interactive and interactive algorithms
This page was built for publication: Beyond the Turing limit: Evolving interactive systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473975)
