Learning to win process-control games watching game-masters
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3681743 (Why is no real title available?)
- scientific article; zbMATH DE number 1104336 (Why is no real title available?)
- Π01-classes and Rado's selection principle
- Classical recursion theory. Vol. II
- Comparison of identification criteria for machine inductive inference
- Inference of finite automata using homing sequences
- Infinite games played on finite graphs
- Learning recursive functions from approximations
- Learning with the knowledge of an upper bound on program size
- On the structure of degrees of inferability.
- On the synthesis of discrete controllers for timed systems
- Probabilistic inductive inference
- Recursively presented games and strategies
- Solving Sequential Conditions by Finite-State Strategies
- Structural measures for games and process control in the branch learning model
- The Power of Pluralism for Automatic Program Synthesis
Cited in
(5)- On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms
- The Existential Fragment of the One-Step Parallel Rewriting Theory
- Learning and teaching as a game: A sabotage approach
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
- Structural measures for games and process control in the branch learning model
This page was built for publication: Learning to win process-control games watching game-masters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854518)