scientific article; zbMATH DE number 2013816
From MaRDI portal
Publication:4437108
zbMath1029.68066MaRDI QIDQ4437108
Jan van Leeuwen, Juraj Wiedermann
Publication date: 7 December 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2509/25090287.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
A broader view on the limitations of information processing and communication by nature ⋮ How We Think of Computing Today ⋮ Computation as an unbounded process ⋮ Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines ⋮ Relativistic computers and the Turing barrier ⋮ General relativistic hypercomputing and foundation of mathematics ⋮ Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
This page was built for publication:
