NDJFL
2010
12 years 11 months ago
2010
We study what the existence of a classical embedding between computable structures implies about the existence of computable embeddings. In particular, we consider the effect of fi...
MLQ
2007
13 years 4 months ago
2007
Let ω denote the set of natural numbers. For functions f, g : ω → ω, we say that f is dominated by g if f(n) < g(n) for all but finitely many n ∈ ω. We consider the st...
NDJFL
1998
13 years 4 months ago
1998
A linear order is n-decidable if its universe is N and the relations determined by n formulas are uniformly computable. This means that there is a computable procedure which, when ...
ECCC
1998
13 years 4 months ago
1998
We consider the existence of pairs of probability ensembles which may be efficiently distinguished from each other given k samples but cannot be efficiently distinguished given ...
APAL
1998
13 years 4 months ago
1998
A model is computable if its domain is a computable set and its relations and functions are uniformly computable. Let A be a computable model and let R be an extra relation on the ...
MST
2000
13 years 4 months ago
2000
A team of learning machines is a multiset of learning machines. A team is said to successfully learn a concept just in case each member of some nonempty subset, of predetermined s...
JSYML
2007
13 years 4 months ago
2007
Abstract. To each computable enumerable (c.e.) set A with a particular enumeration {As}s∈ω, there is associated a settling function mA(x), where mA(x) is the last stage when a n...
JSYML
2007
13 years 4 months ago
2007
We consider embeddings of structures which preserve spectra: if g : M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (a...
SIAMCOMP
2008
13 years 4 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
FOCM
2007
13 years 4 months ago
2007
We show that if a polynomial filled Julia set has empty interior, then it is computable.