An empirical study of the complexity and randomness of prediction error sequences

DOI10.1016/J.CNSNS.2010.10.015zbMath1221.62010OpenAlexW2019016351MaRDI QIDQ718610

Joel Ratsaby

Publication date: 23 September 2011

Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cnsns.2010.10.015

zbMATH Keywords

predictionbinary sequencesalgorithmic complexityinformation theorychaotic scatteringstatistical learningdescription complexity

Mathematics Subject Classification ID

Computational learning theory (68Q32) Statistical aspects of information-theoretic topics (62B10) Complexity and performance of numerical algorithms (65Y20)

Related Items (3)

ON DETERMINISTIC FINITE STATE MACHINES IN RANDOM ENVIRONMENTS ⋮ Recurrence quantity analysis based on singular value decomposition ⋮ On the algorithmic complexity of static structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the algorithmic complexity of static structures
• Interaction of a self vibrating beam with chaotic external forces
• On tables of random numbers
• Kolmogorov-Loveland stochasticity for finite strings
• Can an individual sequence of zeros and ones be random?
• Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity
• Some Properties of Kolmogorov $\Delta$-Random Finite Sequences
• A universal algorithm for sequential data compression
• Computing and Combinatorics
• Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences
• Neural Network Learning
• Elements of Information Theory
• A New Interpretation of the von Mises' Concept of Random Sequence
• The definition of random sequences
• Model selection and error estimation

This page was built for publication: An empirical study of the complexity and randomness of prediction error sequences