1139 search results - page 105 / 228 » Bounded Ideation Theory |
GG
2004
Springer
14 years 1 months ago
2004
Springer
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
STOC
1994
ACM
14 years 20 hour ago
1994
ACM
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandomnumber generators do not exist. This famous result is ...
FCT
2007
Springer
13 years 12 months ago
2007
Springer
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...
AGI
2008
13 years 9 months ago
2008
Learning theory and programs to date are inductively bounded: they can be described as "wind-up toys" which can only learn the kinds of things that their designers envisi...
DAGSTUHL
2006
13 years 9 months ago
2006
In the first part, we introduce binary representations of both lambda calculus and combinatory logic terms, and demonstrate their simplicity by providing very compact parser-inter...