Sciweavers

CIE
2006
Springer
14 years 1 months ago
Prefix-Like Complexities and Computability in the Limit
Alexey V. Chernov, Jürgen Schmidhuber
CIE
2006
Springer
14 years 1 months ago
Understanding and Using Spector's Bar Recursive Interpretation of Classical Analysis
This note reexamines Spector's remarkable computational interpretation of full classical analysis. Spector's interpretation makes use of a rather abstruse recursion schem...
Paulo Oliva
CIE
2006
Springer
14 years 1 months ago
Logspace Complexity of Functions and Structures
Douglas Cenzer, Zia Uddin
CIE
2006
Springer
14 years 1 months ago
Degrees of Weakly Computable Reals
Keng Meng Ng, Frank Stephan, Guohua Wu
CIE
2006
Springer
14 years 1 months ago
Can General Relativistic Computers Break the Turing Barrier?
István Németi, Hajnal Andréka
CIE
2006
Springer
14 years 1 months ago
Deep Inference and Its Normal Form of Derivations
Abstract. We see a notion of normal derivation for the calculus of structures, which is based on a factorisation of derivations and which is more general than the traditional notio...
Kai Brünnler
CIE
2006
Springer
14 years 1 months ago
The Jump Classes of Minimal Covers
We work in D[< 0 ]. Given the jump class of any (Turing) degree a, the jump classes of the minimal covers of a is a matter which is entirely settled unless a is high2. We show t...
Andrew E. M. Lewis
CIE
2006
Springer
14 years 1 months ago
Lower Bounds Using Kolmogorov Complexity
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Sophie Laplante
CIE
2006
Springer
14 years 1 months ago
Datatype-Generic Reasoning
Abstract. Datatype-generic programs are programs that are parameterised by a datatype. Designing datatype-generic programs brings new challenges and new opportunities. We review th...
Roland Carl Backhouse