Sciweavers

268 search results - page 1 / 54
» Recursion Theoretic Operators for Function Complexity Classe...
Sort
View
ISAAC
2005
Springer
109views Algorithms» more  ISAAC 2005»
13 years 10 months ago
Recursion Theoretic Operators for Function Complexity Classes
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...
Kenya Ueno
TPHOL
2002
IEEE
13 years 9 months ago
Type-Theoretic Functional Semantics
We describe the operational and denotational semantics of a small imperative language in type theory with inductive and recursive definitions. The operational semantics is given b...
Yves Bertot, Venanzio Capretta, Kuntal Das Barman
AML
1999
86views more  AML 1999»
13 years 4 months ago
Subrecursive functions on partial sequences
The paper studies a domain theoretical notion of primitive recursion over partial sequences in the context of Scott domains. Based on a non-monotone coding of partial sequences, t...
Karl-Heinz Niggl
ALT
2003
Springer
14 years 1 months ago
Intrinsic Complexity of Uniform Learning
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
Sandra Zilles
APPML
2011
12 years 11 months ago
An operator theoretical approach to a class of fractional order differential equations
We propose a general method to obtain the representation of solutions for linear fractional order differential equations based on the theory of (a, k)-regularized families of oper...
Carlos Lizama