Limit complexities revisited (Q1959396)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Limit complexities revisited	scientific article

Statements

scholarly article

0 references

Limit complexities revisited (English)

0 references

Laurent Bienvenu

0 references

0 references

Andrej A. Muchnik

0 references

Nikolai K. Vereshchagin

0 references

Theory of Computing Systems

0 references

publication date

6 October 2010

0 references

full work available at URL

https://arxiv.org/abs/0802.2833

0 references

zbMATH Keywords

Kolmogorov complexity

0 references

relativization

0 references

limit frequency

0 references

MaRDI profile type

MaRDI publication profile

0 references

Logical basis for information theory and probability theory

0 references

0 references

Degrees of unsolvability of continuous functions

0 references

Lower Limits of Frequencies in Computable Sequences and Relativized a Priori Probability

0 references

Randomness, relativization and Turing degrees

0 references

Classical recursion theory. The theory of functions and sets of natural numbers

0 references

0 references

Kolmogorov complexity conditional to large integers

0 references

THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

0 references

DBLP publication ID

journals/mst/BienvenuMSV10

0 references

10.1007/S00224-009-9203-9

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1959396

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