268 search results - page 8 / 54 » Recursion Theoretic Operators for Function Complexity Classe... |
EUROCOLT
1995
Springer
15 years 1 months ago
1995
Springer
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
ENTCS
2007
14 years 9 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
WG
2005
Springer
15 years 3 months ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
EVOW
1994
Springer
15 years 1 months ago
1994
Springer
The genetic programming (GP) paradigm is a new approach to inductively forming programs that describe a particular problem. The use of natural selection based on a fitness ]unction...
ENTCS
2008
14 years 9 months ago
2008
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...