429 search results - page 8 / 86 » Turing computations on ordinals |
CIE
2005
Springer
15 years 3 months ago
2005
Springer
geometrical computation: Turing-computing ability and undecidability J´erˆome Durand-Lose Laboratoire d’Informatique Fondamentale d’Orl´eans, Universit´e d’Orl´eans, B.P...
CIE
2007
Springer
15 years 3 months ago
2007
Springer
The conventional wisdom presented in most computability books and historical papers is that there were several researchers in the early 1930’s working on various precise defini...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Turing machines exposed to a small stochastic noise are considered. An exact characterisation of their (≈ Π0 2 ) computational power (as noise level tends to 0) is obt...
CSL
2005
Springer
15 years 3 months ago
2005
Springer
We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines...
114
click to vote
COLT
1992
Springer
15 years 1 months ago
1992
Springer
This paper deals with finite size networks which consist of interconnections of synchronously evolving processors. Each processor updates its state by applying a "sigmoidal&q...