CIE
2009
Springer
14 years 7 months ago
2009
Springer
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.
CIE
2009
Springer
14 years 7 months ago
2009
Springer
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...
CIE
2009
Springer
14 years 7 months ago
2009
Springer
CIE
2009
Springer
14 years 7 months ago
2009
Springer
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...
CIE
2009
Springer
14 years 7 months ago
2009
Springer
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...
CIE
2009
Springer
14 years 7 months ago
2009
Springer
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...
CIE
2009
Springer
14 years 7 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...
CIE
2009
Springer
14 years 7 months ago
2009
Springer
CIE
2009
Springer
14 years 7 months ago
2009
Springer
It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strin...
CIE
2009
Springer
14 years 7 months ago
2009
Springer
We investigate the computing power of stateless multicounter machines with reversal-bounded counters. Such a machine has m-counters operating on a one-way input delimited by left a...