886 search results - page 100 / 178 » On the Autoreducibility of Random Sequences |
138
Voted
FOCS
1994
IEEE
15 years 9 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
165
click to vote
COLT
1992
Springer
15 years 9 months ago
1992
Springer
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
160
click to vote
BC
2008
15 years 5 months ago
2008
Abstract In this study we set to investigate visual attention properties of freely behaving barn owls using a miniature wireless camera attached to their heads. The tubular eye str...
151
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
Sequential change diagnosis is the joint problem of detection and identification of a sudden and unobservable change in the distribution of a random sequence. In this problem, the...
137
Voted
IJBC
2007
15 years 5 months ago
2007
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...