Most sequences are stochastic (Q1854454)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Most sequences are stochastic	scientific article

Statements

scholarly article

0 references

Most sequences are stochastic (English)

0 references

Information and Computation

0 references

publication date

14 January 2003

0 references

Vladimir V. V'yugin

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1006/inco.2001.3041

0 references

Computational learning theory. 2nd European Conference, EuroCOLT '95, Barcelona, Spain, March 13-15, 1995. Proceedings

0 references

Randomness conservation inequalities; information and independence in mathematical theories

0 references

0 references

0 references

A game of prediction with expert advice

0 references

Complexity Approximation Principle

0 references

Nonstochastic estimates

0 references

On the Defect of Randomness of a Finite Object with Respect to Measures with Given Complexity Bounds

0 references

Non-stochastic infinite and finite sequences

0 references

Suboptimal measures of predictive complexity for absolute loss function

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

0 references

zbMATH DE Number

0 references

0 references

10.1006/INCO.2001.3041

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1854454

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