4 search results - page 1 / 1 » Weihrauch Degrees, Omniscience Principles and Weak Computabi... |
CCA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
CCA
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
JC
2000
13 years 4 months ago
2000
The Turing degree of a real number x is defined as the Turing degree of its binary expansion. This definition is quite natural and robust. In this paper we discuss some basic degr...
SC
2009
ACM
13 years 11 months ago
2009
ACM
The UNIC code is being developed as part of the DOE’s Nuclear Energy Advanced Modeling and Simulation (NEAMS) program. UNIC is an unstructured, deterministic neutron transport c...