Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
NDJFL
2010
10 years 5 months ago
Embeddings of Computable Structures
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...
Asher M. Kach, Oscar Levin, Reed Solomon
MLQ
2007
91views more  MLQ 2007»
10 years 10 months ago
Almost everywhere domination and superhighness
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...
Stephen G. Simpson
NDJFL
1998
81views more  NDJFL 1998»
10 years 10 months ago
An Undecidable Linear Order That Is n-Decidable for All n
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 ...
John Chisholm, Michael Moses
ECCC
1998
88views more  ECCC 1998»
10 years 10 months ago
Computational Indistinguishability: A Sample Hierarchy
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 ...
Oded GoldreichMadhu Sudan
APAL
1998
56views more  APAL 1998»
10 years 10 months ago
Turing Degrees of Certain Isomorphic Images of Computable Relations
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 ...
Valentina S. Harizanov
MST
2000
86views more  MST 2000»
10 years 10 months ago
Team Learning of Computable Languages
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...
Sanjay Jain, Arun Sharma
JSYML
2007
78views more  JSYML 2007»
10 years 10 months ago
The settling-time reducibility ordering
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...
Barbara F. Csima, Richard A. Shore
JSYML
2007
66views more  JSYML 2007»
10 years 10 months ago
Spectra of structures and relations
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...
Valentina S. Harizanov, Russel G. Miller
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
10 years 10 months ago
Plottable Real Number Functions and the Computable Graph Theorem
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...
Vasco Brattka
FOCM
2007
83views more  FOCM 2007»
10 years 10 months ago
Filled Julia Sets with Empty Interior Are Computable
We show that if a polynomial filled Julia set has empty interior, then it is computable.
Ilia Binder, Mark Braverman, Michael Yampolsky
books