31 search results - page 2 / 7 » Computing the Noncomputable |
MCU
2007
13 years 6 months ago
2007
Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tri...
IFIPTCS
2010
13 years 3 months ago
2010
Abstract. We investigate systematically into the various possible notions of traceable sets and the relations they bear to each other and to other notions such as diagonally noncom...
ROBOCUP
1998
Springer
13 years 9 months ago
1998
Springer
Developing agents for simulation environments is usually the responsibility of computer experts. However, as domain experts have superior knowledge of the intended agent behavior, ...
JMLR
2010
13 years 4 days ago
2010
As we devise more complicated prior distributions, will inference algorithms keep up? We highlight a negative result in computable probability theory by Ackerman, Freer, and Roy (...
CSR
2007
Springer
13 years 9 months ago
2007
Springer
We study the empirical meaning of randomness with respect to a family of probability distributions P, where is a real parameter, using algorithmic randomness theory. In the case w...