Results 1  10
of
457,085
Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition
 in Conference Record of The TwentySeventh Asilomar Conference on Signals, Systems and Computers
, 1993
"... In this paper we describe a recursive algorithm to compute representations of functions with respect to nonorthogonal and possibly overcomplete dictionaries of elementary building blocks e.g. aiEne (wa.velet) frames. We propoeea modification to the Matching Pursuit algorithm of Mallat and Zhang (199 ..."
Abstract

Cited by 622 (1 self)
 Add to MetaCart
In this paper we describe a recursive algorithm to compute representations of functions with respect to nonorthogonal and possibly overcomplete dictionaries of elementary building blocks e.g. aiEne (wa.velet) frames. We propoeea modification to the Matching Pursuit algorithm of Mallat and Zhang
Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I
, 1960
"... this paper in L a T E Xpartly supported by ARPA (ONR) grant N000149410775 to Stanford University where John McCarthy has been since 1962. Copied with minor notational changes from CACM, April 1960. If you want the exact typography, look there. Current address, John McCarthy, Computer Science Depa ..."
Abstract

Cited by 452 (3 self)
 Add to MetaCart
Department, Stanford, CA 94305, (email: jmc@cs.stanford.edu), (URL: http://wwwformal.stanford.edu/jmc/ ) by starting with the class of expressions called Sexpressions and the functions called Sfunctions. In this article, we first describe a formalism for defining functions recursively. We believe
The Complexity of Real Recursive Functions
 Unconventional Models of Computation (UMC'02), LNCS 2509
, 2002
"... We explore recursion theory on the reals, the analog counterpart of recursive function theory. In recursion theory on the reals, the discrete operations of standard recursion theory are replaced by operations on continuous functions, such as composition and various forms of differential equations. W ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
We explore recursion theory on the reals, the analog counterpart of recursive function theory. In recursion theory on the reals, the discrete operations of standard recursion theory are replaced by operations on continuous functions, such as composition and various forms of differential equations
Linear Recursive Functions
"... With the recent trend of analysing the process of computation through the linear logic looking glass, it is well understood that the ability to copy and erase data is essential in order to obtain a Turingcomplete computation model. However, erasing and copying do not need to be explicitly included ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
in Turingcomplete computation models: in this paper we show that the class of partial recursive functions that are syntactically linear (that is, partial recursive functions where no argument is erased or copied) is Turingcomplete.
UNARY PRIMITIVE RECURSIVE FUNCTIONS
, 2006
"... Abstract. In this article, we study some new characterizations of primitive recursive functions based on restricted forms of primitive recursion, improving the pioneering work of R. M. Robinson and M. D. Gladstone in this area. We reduce certain recursion schemes (mixed/pure iteration without parame ..."
Abstract
 Add to MetaCart
Abstract. In this article, we study some new characterizations of primitive recursive functions based on restricted forms of primitive recursion, improving the pioneering work of R. M. Robinson and M. D. Gladstone in this area. We reduce certain recursion schemes (mixed/pure iteration without
Partial Recursive Functions and Finality
"... Abstract. We seek universal categorical conditions ensuring the representability of all partial recursive functions. In the category Pfn of sets and partial functions, the natural numbers provide both an initial algebra and a final coalgebra for the functor 1 + −. We recount how finality yields clos ..."
Abstract
 Add to MetaCart
Abstract. We seek universal categorical conditions ensuring the representability of all partial recursive functions. In the category Pfn of sets and partial functions, the natural numbers provide both an initial algebra and a final coalgebra for the functor 1 + −. We recount how finality yields
A Note on Recursive Functions
 MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE
, 1996
"... In this paper, we propose a new and elegant definition of the class of recursive functions, analogous to Kleene's definition but differing in the primitives taken, thus demonstrating the computational power of the concurrent programming language introduced in [Walters 1991, Walters 1992, Khalil ..."
Abstract

Cited by 9 (8 self)
 Add to MetaCart
In this paper, we propose a new and elegant definition of the class of recursive functions, analogous to Kleene's definition but differing in the primitives taken, thus demonstrating the computational power of the concurrent programming language introduced in [Walters 1991, Walters 1992
Accessible Recursive Functions
 Bulletin of Symbolic Logic
, 1999
"... . The class of all recursive functions fails to possess a natural hierarchical structure, generated predicatively from "within". On the other hand, many (prooftheoretically significant) subrecursive classes do. This paper attempts to measure the limit of predicative generation in this co ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. The class of all recursive functions fails to possess a natural hierarchical structure, generated predicatively from "within". On the other hand, many (prooftheoretically significant) subrecursive classes do. This paper attempts to measure the limit of predicative generation
Recursive Function Definition
"... Abstract. Using the notions of unique fixed point, converging equivalence relation, and contracting function, we generalize the technique of wellfounded recursion. We are able to define functions in the Isabelle theorem prover that recursively call themselves an infinite number of times. In particu ..."
Abstract
 Add to MetaCart
Abstract. Using the notions of unique fixed point, converging equivalence relation, and contracting function, we generalize the technique of wellfounded recursion. We are able to define functions in the Isabelle theorem prover that recursively call themselves an infinite number of times
Transforming programs into recursive functions
 In Brazilian Symposium on Formal Methods (SBMF 2008), volume 240 of ENTCS
, 2009
"... This paper presents a new proofassistant based approach to program verification: programs are translated, via fullyautomatic deduction, into tailrecursive function defined in the logic of a theorem prover. This approach improves on wellestablished methods based on Hoare logic and verification co ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
This paper presents a new proofassistant based approach to program verification: programs are translated, via fullyautomatic deduction, into tailrecursive function defined in the logic of a theorem prover. This approach improves on wellestablished methods based on Hoare logic and verification
Results 1  10
of
457,085