Turing computations on ordinals
نویسنده
چکیده
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 set of ordinals is ordinal computable from a finite set of ordinal parameters if and only if it is an element of Gödel’s constructible universe L. This characterization can be used to prove the generalized continuum hypothesis in L.
منابع مشابه
Computing a Model of Set Theory
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 generalized Turing machine is able to compute a recursive bounded truth predicate on the ordinals. The class of sets of ordinals which can be read off the truth predicate satisfies a natural theory SO. SO is the theory of the ...
متن کاملTree Representations via Ordinal Machines
We study sets of reals computable by ordinal Turing machines with a tape of length the ordinals that are steered by a standard Turing program. The machines halt at some ordinal time or diverge. We construct tree representations for ordinal semidecidable sets of reals from ordinal computations. The aim is to generalize uniformization results to classes of sets which are semi-decidable by computa...
متن کاملOrdinal computations
The notion of ordinal computability is defined by generalising standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The fundamental theorem on ordinal computability states that a set x of ordinals is ordinal computable from ordinal parameters if and only if x is an element of the constructible universe L. In this paper we present a new proof o...
متن کاملThe Transfinite Action of 1 Tape Turing Machines
• We produce a classification of the pointclasses of sets of reals produced by infinite time turing machines with 1-tape. The reason for choosing this formalism is that it apparently yields a smoother classification of classes defined by algorithms that halt at limit ordinals. • We consider some relations of such classes with other similar notions, such as arithmetical quasi-inductive definitio...
متن کاملInfinite Time Turing Machines With Only One Tape
Infinite time Turing machines with only one tape are in many respects fully as powerful as their multi-tape cousins. In particular, the two models of machine give rise to the same class of decidable sets, the same degree structure and, at least for functions f .. R → N, the same class of computable functions. Nevertheless, there are infinite time computable functions f : R → R that are not one-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Bulletin of Symbolic Logic
دوره 11 شماره
صفحات -
تاریخ انتشار 2005