Stationary algorithmic probability (Q1041228)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Stationary algorithmic probability	scientific article

Statements

scholarly article

0 references

Stationary algorithmic probability (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.tcs.2009.09.017

0 references

Theoretical Computer Science

0 references

publication date

1 December 2009

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

algorithmic probability

0 references

Kolmogorov complexity

0 references

Markov chain

0 references

emulation

0 references

emulation complexity

0 references

Markus P. Müller

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.tcs.2009.09.017

0 references

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

A Theory of Program Size Formally Identical to Information Theory

0 references

0 references

The discovery of algorithmic probability

0 references

Universal artificial intelligence. Sequential decisions based on algorithmic probability.

0 references

Algorithmic information and simplicity in statistical physics

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1041228

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