320 search results - page 1 / 64 » Minimality considerations for ordinal computers modeling con... |
59
Voted
TCS
2008
15 years 3 months ago
2008
139
click to vote
CIE
2005
Springer
15 years 9 months ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...
106
Voted
CIE
2009
Springer
15 years 10 months ago
2009
Springer
computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines,...
154
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
110
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Nonlinear registration is mostly performed after initialization by a global, linear transformation (in this work, we focus on similarity transformations), computed by a linear reg...