3378 search results - page 1 / 676 » Learning in Friedberg Numberings |
ALT
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we consider learnability in some special numberings, such as Friedberg numberings, which contain all the recursively enumerable languages, but have simpler grammar e...
CIE
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The family of all Martin-L¨of random left-compu...
Publication
Improve your knowledge of the Spanish Language by learning new Spanish vocabulary, Spanish Grammar, Spanish pronunciation and other Spanish Language resources.
MLQ
2011
12 years 11 months ago
2011
Given a graph G whose set of vertices is a Polish space X, the weak Borel chromatic number of G is the least size of a family of pairwise disjoint G-independent Borel sets that cov...
ICML
2000
IEEE
14 years 5 months ago
2000
IEEE
