Pages that link to "Item:Q4921439"
From MaRDI portal
The following pages link to Effective Randomness for Computable Probability Measures (Q4921439):
Displaying 12 items.
- Randomness on computable probability spaces -- a dynamical point of view (Q537913) (← links)
- Algorithmic randomness and monotone complexity on product space (Q627131) (← links)
- An approach of randomness of a sample based on its weak ergodic limit (Q1658187) (← links)
- Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs (Q1881272) (← links)
- Statistical properties of dynamical systems -- Simulation and abstract computation (Q2393223) (← links)
- Algorithmically Random Functions and Effective Capacities (Q2948450) (← links)
- A relation between correctness and randomness in the computation of probabilistic algorithms (Q3345786) (← links)
- RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY (Q4579818) (← links)
- Effective Brenier Theorem (Q4635935) (← links)
- Computable Measure Theory and Algorithmic Randomness (Q5024573) (← links)
- Automata, Languages and Programming (Q5466531) (← links)
- Computability in infinite Galois theory and algorithmically random algebraic fields (Q6641590) (← links)