scientific article; zbMATH DE number 2080910
From MaRDI portal
Publication:4473975
zbMath1052.68045MaRDI QIDQ4473975
Jan van Leeuwen, Juraj Wiedermann
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2234/22340090.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
Towards “Fypercomputations” (in Membrane Computing) ⋮ Short variable length domain extenders with beyond birthday bound security ⋮ Autopoietic automata: complexity issues in offspring-producing evolving processes ⋮ On the Executability of Interactive Computation ⋮ Reactive Turing machines ⋮ Question answering by humans and machines: a complexity-theoretic view ⋮ How We Think of Computing Today ⋮ The expressive power of analog recurrent neural networks on infinite input streams ⋮ 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
This page was built for publication:
