429 search results - page 60 / 86 » Turing computations on ordinals |
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
We present an algorithm for clustering sets of detected
interest points into groups that correspond to visually dis-
tinct structure. Through the use of a suitable colour and tex...
109
Voted
SPW
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Many users routinely log in to their system with system administrator privileges. This is especially true of home users. The advantage of this setup is that these users c...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers p...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
CIE
2010
Springer
15 years 2 months ago
2010
Springer
The Tile Assembly Model is a Turing universal model that Winfree introduced in order to study the nanoscale self-assembly of complex (typically aperiodic) DNA crystals. Winfree ex...