Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity

From MaRDI portal
Publication:3590938
Jump to:navigation, search

DOI10.1007/978-3-540-70918-3_23zbMath1186.68225OpenAlexW1601300069MaRDI QIDQ3590938

Laurent Bienvenu

Publication date: 3 September 2007

Published in: STACS 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_23



Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)


Related Items (2)

ON DETERMINISTIC FINITE STATE MACHINES IN RANDOM ENVIRONMENTS ⋮ An empirical study of the complexity and randomness of prediction error sequences







This page was built for publication: Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3590938&oldid=17004907"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 03:22.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki