Computing and Combinatorics
From MaRDI portal
Publication:5716953
DOI10.1007/11533719zbMath1128.03307OpenAlexW4376561447MaRDI QIDQ5716953
Zheng, Xizhong, Robert Rettinger
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/11533719
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80)
Related Items (8)
Randomness and universal machines ⋮ Differences of halting probabilities ⋮ CHAITIN’S Ω AS A CONTINUOUS FUNCTION ⋮ Unnamed Item ⋮ On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals ⋮ Random numbers as probabilities of machine behavior ⋮ On the hierarchies of Δ20-real numbers ⋮ Computability of Real Numbers
This page was built for publication: Computing and Combinatorics
