320 search results - page 1 / 64 » Minimality considerations for ordinal computers modeling con... |
TCS
2008
13 years 7 months ago
2008
CIE
2005
Springer
14 years 29 days 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...
CIE
2009
Springer
14 years 2 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,...
FSTTCS
2009
Springer
14 years 2 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 ...
CVPR
2008
IEEE
14 years 9 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...