Why it is computationally harder to reconstruct the past than to predict the future
From MaRDI portal
(Redirected from Publication:1376490)
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
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 1206056 (Why is no real title available?)
- scientific article; zbMATH DE number 804135 (Why is no real title available?)
- scientific article; zbMATH DE number 869736 (Why is no real title available?)
- scientific article; zbMATH DE number 869738 (Why is no real title available?)
- scientific article; zbMATH DE number 903768 (Why is no real title available?)
- Approximate linear algebra is intractable
- 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
- NP-hard classes of linear algebraic systems with uncertainties
- On the Shape of the Symmetric, Persymmetric, and Skew-Symmetric Solution Set
- The Shape of the Solution Set for Systems of Interval Linear Equations with Dependent Coefficients
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)