Sciweavers

CIE
2009
Springer
13 years 11 months ago
Lowness for Demuth Randomness
We show that every real low for Demuth randomness is of hyperimmune-free degree.
Rod Downey, Keng Meng Ng
CIE
2009
Springer
13 years 11 months ago
Program Self-reference in Constructive Scott Subdomains
Abstract. Intuitively, a recursion theorem asserts the existence of selfreferential programs. Two well-known recursion theorems are Kleene’s Recursion Theorem (krt) and Rogers’...
John Case, Samuel E. Moelius
CIE
2009
Springer
13 years 11 months ago
Decidability of Sub-theories of Polynomials over a Finite Field
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
Alla Sirokofskich
CIE
2009
Springer
13 years 11 months ago
Ordinal Computability
computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines,...
Peter Koepke
CIE
2009
Springer
13 years 11 months ago
Notes on the Jump of a Structure
We introduce the notions of a complete set of computably infinitary Π0 n relations on a structure, of the jump of a structure, and of admitting nth jump inversion.
Antonio Montalbán
CIE
2009
Springer
13 years 11 months ago
Index Sets and Universal Numberings
This paper studies the Turing degrees of various properties defined for universal numberings, that is, for numberings which list all partial-recursive functions. In particular pro...
Sanjay Jain, Frank Stephan, Jason Teutsch
CIE
2009
Springer
13 years 11 months ago
Equivalence Relations on Classes of Computable Structures
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
Ekaterina B. Fokina, Sy-David Friedman
CIE
2009
Springer
13 years 11 months ago
Computational Heuristics for Simplifying a Biological Model
Abstract. Computational biomodelers adopt either of the following approaches: build rich, as complete as possible models in an effort to obtain very realistic models, or on the co...
Ion Petre, Andrzej Mizera, Ralph-Johan Back
CIE
2009
Springer
13 years 11 months ago
Dialectica Interpretation with Fine Computational Control
This paper is an attempt to refine Hernest’s [2] extension of Berger’s uniform quantifiers [1] to G¨odel’s functional (Dialectica) interpretation [3]. We consider the poss...
Trifon Trifonov