Why it is computationally harder to reconstruct the past than to predict the future
From MaRDI portal
Publication:1376490
DOI10.1007/BF02435838zbMATH Open0885.65047OpenAlexW2045461672MaRDI QIDQ1376490FDOQ1376490
Authors: Misha Koshelev, Gotz Alefeld, Günter Mayer 
Publication date: 2 April 1998
Published in: International Journal of Theoretical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02435838
Recommendations
- Prediction, retrodiction, and the amount of information stored in the present
- Algorithmic complexity bounds on future prediction errors
- Predicting the future. Completing models of observed complex systems
- Efficient computing procedures and impossibility to solve the problem of exact prediction of events in the quantum world
- Reversibility and Predictions
- scientific article; zbMATH DE number 2086606
- On the ``prediction problem
- The nature of prediction (and the prediction of nature)
- Predictability, complexity, and learning
Cites Work
- Title not available (Why is that?)
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard
- The Shape of the Solution Set for Systems of Interval Linear Equations with Dependent Coefficients
- NP-hard classes of linear algebraic systems with uncertainties
- Title not available (Why is that?)
- Approximate linear algebra is intractable
- Title not available (Why is that?)
- On the Shape of the Symmetric, Persymmetric, and Skew-Symmetric Solution Set
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Why it is computationally harder to reconstruct the past than to predict the future
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1376490)
