Sciweavers

154 search results - page 1 / 31
» Cobham recursive set functions
Sort
View
CSL
2010
Springer
14 years 11 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
ALT
1999
Springer
15 years 2 months ago
On the Uniform Learnability of Approximations to Non-Recursive Functions
Abstract. Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem is reliably EX-learnable. These investigations are carried on by sh...
Frank Stephan, Thomas Zeugmann
ICECCS
2010
IEEE
105views Hardware» more  ICECCS 2010»
14 years 8 months ago
On Immunological Memory as a Function of a Recursive Proliferation Process
—We present a model that explains immunological memory as a consequence of the recursive proliferation of reactive and suppressive cells, where the relative proportion of these c...
Thomas Stibor, Anastasio Salazar-Bañuelos
GECCO
2004
Springer
116views Optimization» more  GECCO 2004»
15 years 3 months ago
Using Genetic Programming to Obtain a Closed-Form Approximation to a Recursive Function
Abstract. We demonstrate a fully automated method for obtaining a closedform approximation of a recursive function. This method resulted from a realworld problem in which we had a ...
Evan Kirshenbaum, Henri Jacques Suermondt
IDEAL
2005
Springer
15 years 3 months ago
Recursive Self-organizing Map as a Contractive Iterative Function System
Recently, there has been a considerable research activity in extending topographic maps of vectorial data to more general data structures, such as sequences or trees. However, the ...
Peter Tiño, Igor Farkas, Jort van Mourik