scientific article; zbMATH DE number 2013202
From MaRDI portal
Publication:4436369
zbMath1027.03512MaRDI QIDQ4436369
No author found.
Publication date: 4 December 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)
Related Items (3)
Algorithmic complexity as a criterion of unsolvability ⋮ Non-isometric quantum error correction in gravity ⋮ Chaitin Ω Numbers and Halting Problems
This page was built for publication:
