You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.
The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.
For the reports in this repository we specifically note that
- the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
- the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
- technical reports and other articles issued by MÃ¤lardalen University is free for personal use. For other use, the explicit consent of the authors is required
- in other cases, please contact the copyright owner for detailed information
By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.
If you are in doubt, feel free to contact email@example.com
Computation, learning and games - some current questions
<A HREF=http://www.mdh.se/cgi-bin/person-e?Richard++Bonner+IMa>Richard Bonner</A>
Turing Conference Room
The study of these three notions in a single
setting goes back to Solomonoff and Gold in the sixties. The
idea was then the "identification in the limit": roughly, an
object was learnable if it could be identified (by a machine)
in a finite number of moves in a guessing game. The learning
environment (game) consisted of recursive objects and suited
well the Turing model of computation. In the three decades
that followed, all three concepts have been studied
intensively and received multiple interpretations. Yet,
despite (or, perhaps, due to!?) the vastness of the scientific
production, some rather basic questions about their
relationship have remained in the shadow. I will exemplify
this claim in three problems
(i) learning in domains,
(ii) complexity origins of logic, and,
(iii) learning in quantum games.