Sciweavers

66
Voted
CIE
2006
Springer
15 years 4 months ago
A Subrecursive Refinement of the Fundamental Theorem of Algebra
Peter Peshev, Dimiter Skordev
52
Voted
CIE
2006
Springer
15 years 4 months ago
Prefix-Like Complexities and Computability in the Limit
Alexey V. Chernov, Jürgen Schmidhuber
CIE
2006
Springer
15 years 4 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
50
Voted
CIE
2006
Springer
15 years 4 months ago
Logspace Complexity of Functions and Structures
Douglas Cenzer, Zia Uddin
60
Voted
CIE
2006
Springer
15 years 4 months ago
Degrees of Weakly Computable Reals
Keng Meng Ng, Frank Stephan, Guohua Wu
50
Voted
CIE
2006
Springer
15 years 4 months ago
Can General Relativistic Computers Break the Turing Barrier?
István Németi, Hajnal Andréka
56
Voted
CIE
2006
Springer
15 years 4 months ago
A Measure of Space for Computing over the Reals
Paulin Jacobé de Naurois
75
Voted
CIE
2006
Springer
15 years 4 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
63
Voted
CIE
2006
Springer
15 years 4 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