429 search results - page 53 / 86 » Turing computations on ordinals |
IGPL
2008
14 years 9 months ago
2008
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
110
Voted
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
We introduce a text-based image feature and demon-
strate that it consistently improves performance on hard
object classification problems. The feature is built using
an auxilia...
COCO
2010
Springer
14 years 11 months ago
2010
Springer
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
LICS
2006
IEEE
15 years 3 months ago
2006
IEEE
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...
133
click to vote
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Turing complete Genetic Programming (GP) models introduce the concept of internal state, and therefore have the capacity for identifying interesting temporal properties. Surprisin...