Numberings and Randomness (Q3576037)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Numberings and Randomness	scientific article

Statements

scholarly article

0 references

Numberings and Randomness (English)

0 references

0 references

Bjørn Kjos-Hanssen

0 references

Mathematical Theory and Computational Practice

0 references

publication date

28 July 2010

0 references

full work available at URL

https://arxiv.org/abs/1408.2169

0 references

MaRDI profile type

MaRDI publication profile

0 references

Effectively closed sets and enumerations

0 references

0 references

Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication

0 references

0 references

An easy priority-free proof of a theorem of Friedberg

0 references

Computability and Randomness

0 references

An extension of the recursively enumerable Turing degrees

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-03073-4_6

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3576037

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3576037&oldid=35180500"