1017 search results - page 2 / 204 » Register computations on ordinals |
CIE
2005
Springer
14 years 1 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...
BSL
2005
13 years 7 months ago
2005
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length to computations on tapes of arbitrary ordinal length. We show that a ...
SMILE
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. Since uncalibrated images permit only projective reconstruction, metric information requires either camera or scene calibration. We propose a stratified approach to proje...
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
In this paper we introduce a block-based approach for ordinal co-occurrence matrices aimed at improving robustness of the basic ordinal co-occurrence. Earlier, we have introduced t...
WOLLIC
2007
Springer
14 years 1 months ago
2007
Springer
Hydra games were introduced by Kirby and Paris, for the formulation of a result which is independent from Peano arithmetic but depends on the transfinite structure of 0. Tree ordi...