Randomness is inherently imprecise
From MaRDI portal
Publication:2069032
Recommendations
Cites work
- A frequentist understanding of sets of measures
- A particular upper expectation as global belief model for discrete-time finite-state uncertain processes
- A recursive algorithm for computing inferences in imprecise Markov chains
- A representation of partially ordered preferences
- Algorithmic randomness and complexity.
- An extension of chaotic probability models to real-valued variables
- Average behaviour in discrete-time imprecise Markov chains: a study of weak ergodicity
- Calibration-based empirical probability
- Computable randomness is about more than probabilities
- Desirability
- Failure of calibration is typical
- Game-theoretic foundations for probability and finance
- Game-theoretic probability
- Game-theoretic upper expectations for discrete-time finite-state uncertain processes
- scientific article; zbMATH DE number 3427210 (Why is no real title available?)
- scientific article; zbMATH DE number 3886817 (Why is no real title available?)
- scientific article; zbMATH DE number 5606368 (Why is no real title available?)
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 48344 (Why is no real title available?)
- scientific article; zbMATH DE number 107774 (Why is no real title available?)
- scientific article; zbMATH DE number 3489016 (Why is no real title available?)
- scientific article; zbMATH DE number 3560492 (Why is no real title available?)
- scientific article; zbMATH DE number 1531917 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- scientific article; zbMATH DE number 969633 (Why is no real title available?)
- Imprecise continuous-time Markov chains
- IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR
- Imprecise probability trees: bridging two theories of imprecise probability
- Imprecise stochastic processes in discrete time: global models, imprecise Markov chains, and ergodic theorems
- Introduction to imprecise probabilities
- Lower Previsions
- Lévy's zero-one law in game-theoretic probability
- Mathematical metaphysics of randomness
- Merging of opinions in game-theoretic probability
- Non-additive probabilities in the work of Bernoulli and Lambert
- On the apparent convergence of relative frequency and its implications
- On the concept of a random sequence
- Prequential probability: principles and properties
- Prequential randomness and probability
- Present Position and Potential Developments: Some Personal Views: Statistical Theory: The Prequential Approach
- Probability and finance. It's only a game!
- Process complexity and effective random tests
- Rethinking the Foundations of Statistics
- Self-Calibrating Priors Do Not Exist
- The axioms and algebra of intuitive probability
- The definition of random sequences
- The Well-Calibrated Bayesian
- Towards a frequentist theory of upper and lower probability
- Upper and Lower Probabilities Induced by a Multivalued Mapping
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
Cited in
(6)- On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness
- The smallest probability interval a sequence is random for: a study for six types of randomness
- Randomness is inherently imprecise
- Imprecision in martingale- and test-theoretic prequential randomness
- A comparative study of the smallest probability intervals for which a binary sequence is random
- Randomness and imprecision: from supermartingales to randomness tests
This page was built for publication: Randomness is inherently imprecise
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2069032)
