New Computational Paradigms

DOI10.1007/B136981zbMath1115.03054OpenAlexW2278484831MaRDI QIDQ5717075

Frank Stephan, Guohua Wu

Publication date: 11 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b136981

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80) Turing machines and related notions (03D10) Theory of numerations, effectively presented structures (03D45)

Related Items (3)

Genericity of weakly computable objects ⋮ Initial segment complexities of randomness notions ⋮ A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES

This page was built for publication: New Computational Paradigms