Computability of Recursive Functions
Journal of the ACM (JACM)
Flow diagrams, turing machines and languages with only two formation rules
Communications of the ACM
Computable functions and semicomputable sets on many-sorted algebras
Handbook of logic in computer science
Computation: finite and infinite machines
Computation: finite and infinite machines
| Hi-index | 5.23 |
We describe a simple model of ordinal computation which can compute truth in the constructible universe. We try to use well-structured programs and direct limits of states at limit times whenever possible. This may make it easier to define a model of ordinal computation within other systems of hypercomputation, especially systems inspired by physical models. We write a program to compute truth in the constructible universe on an ordinal register machine. We prove that the number of registers in a well-structured universal ordinal register machine is always =4, greater than the minimum number of registers in a well-structured universal finite-time natural number-storing register machine, but that it can always be kept finite. We conjecture that this number is four. We compare the efficiency of our program which computes the constructible sets to that of a similar program for an ordinal Turing machine.