Sciweavers

38 search results - page 6 / 8
» cca 2009
Sort
View
CCA
2009
Springer
14 years 4 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
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 ...
Vasco Brattka, Guido Gherardi
CCA
2009
Springer
14 years 4 months ago
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
Martin Ziegler
CCA
2009
Springer
14 years 4 months ago
Separations of Non-monotonic Randomness Notions
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
Laurent Bienvenu, Rupert Hölzl, Thorsten Kr&a...
ICFP
2009
ACM
14 years 10 months ago
Causal commutative arrows and their optimization
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
Hai Liu, Eric Cheng, Paul Hudak
QOSA
2009
Springer
14 years 4 months ago
Adaptive Application Composition in Quantum Chemistry
Abstract. Component interfaces, as advanced by the Common Component Architecture (CCA), enable easy access to complex software packages for high-performance scientific computing. ...
Li Li, Joseph P. Kenny, Meng-Shiou Wu, Kevin A. Hu...