54 search results - page 5 / 11 » cie 2007 |
75
Voted
CIE
2007
Springer
15 years 4 months ago
2007
Springer
We study Post’s Problem for the ordinal register machines defined in [6], showing that its general solution is positive, but that any set of ordinals solving it must be unbounde...
CIE
2007
Springer
15 years 4 months ago
2007
Springer
We introduce the notion of a locally computable structure, a natural way of generalizing the notions of computable model theory to uncountable structures S by presenting the finit...
CIE
2007
Springer
15 years 1 months ago
2007
Springer
A guiding question in the study of weak 2-randomness is whether weak 2-randomness is closer to 1-randomness, or closer to 2randomness. Recent research indicates that the first alte...
CIE
2007
Springer
15 years 1 months ago
2007
Springer
We investigate the notion of K-triviality for closed sets and continuous functions. Every K-trivial closed set contains a K-trivial real. There exists a K-trivial 0 1 class with no...
CIE
2007
Springer
15 years 1 months ago
2007
Springer
Nonlinear dynamical and control systems are an important source of applications for theories of computation over the the real numbers, since these systems are usually to complicate...