Numberings and Randomness

DOI10.1007/978-3-642-03073-4_6zbMath1268.03057arXiv1408.2169OpenAlexW3102175244MaRDI QIDQ3576037

Bjørn Kjos-Hanssen, Paul Brodhead

Publication date: 28 July 2010

Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.2169

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Algorithmic randomness and dimension (03D32)

Related Items (3)

Effectively infinite classes of numberings of computable families of reals ⋮ Things that can be made into themselves ⋮ Reductions between types of numberings

Cites Work

• Unnamed Item
• Unnamed Item
• An easy priority-free proof of a theorem of Friedberg
• Effectively closed sets and enumerations
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• An extension of the recursively enumerable Turing degrees
• Computability and Randomness

This page was built for publication: Numberings and Randomness