Computability of Recursive Functions
Journal of the ACM (JACM)
An Enhanced Theory of Infinite Time Register Machines
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Hi-index | 0.00 |
We identify a number of theories of strength that of Π11- CA0. In particular: (a) the theory that the set of points attracted to the origin in a generalised transfinite dynamical system of any n-dimensional integer torus exists; (b) the theory asserting that for any Z ⊆ ω and n, the halting set HnZ of infinite time n-register machine with oracle Z exists.