Structural measures for games and process control in the branch learning model
From MaRDI portal
Publication:1575709
DOI10.1016/S0304-3975(98)00339-9zbMath0945.68150MaRDI QIDQ1575709
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism ⋮ Learning to win process-control games watching game-masters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison of identification criteria for machine inductive inference
- On the structure of degrees of inferability.
- Recursively presented games and strategies
- Classical recursion theory. Vol. II
- Infinite games played on finite graphs
- Extremes in the degrees of inferability
- On some games which are relevant to the theory of recursively enumerable sets
- Learning to win process-control games watching game-masters
- Inductive inference and unsolvability
- Toward a mathematical theory of inductive inference
- Control of Infinite Behavior of Finite Automata
- On the synthesis of strategies in infinite games
- On the synthesis of discrete controllers for timed systems
- Solving Sequential Conditions by Finite-State Strategies
- Language identification in the limit
