Testing randomness by Matching Pennies
From MaRDI portal
Publication:6643370
Cites work
- scientific article; zbMATH DE number 3132222 (Why is no real title available?)
- scientific article; zbMATH DE number 5606368 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1010621 (Why is no real title available?)
- scientific article; zbMATH DE number 2168212 (Why is no real title available?)
- scientific article; zbMATH DE number 2123258 (Why is no real title available?)
- scientific article; zbMATH DE number 2188025 (Why is no real title available?)
- A Semantical Approach to Equilibria and Rationality
- A formal theory of inductive inference. Part II
- Algorithmic Game Theory
- Algorithmic randomness and complexity.
- Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting
- Compression of individual sequences via variable-rate coding
- Computability and randomness
- Computable strategies for repeated prisoner's dilemma
- Information and complexity in statistical modeling.
- Language identification in the limit
- Monoidal computer. I: Basic computability by string diagrams
- Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
- Non-computable strategies and discounted repeated games
- On computable numbers, with an application to the Entscheidungsproblem.
- On tables of random numbers
- Programs as Diagrams
- Statistical methods for research workers.
- Sur la notion de collectif.
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The definition of random sequences
- Toward a mathematical theory of inductive inference
- Universal probability-free prediction
This page was built for publication: Testing randomness by Matching Pennies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6643370)
