Abstract
This paper shows some of the differences and similarities between computation and hypercomputation, the similarities relating to the complexity of propositional computation and the differences being the propositions that can be decided computationally or hypercomputationally. The methods used are ordinal Turing machines with infinitely long programs and diagonalization out of computing complexity classes. The main results are the characterization of inequalities of run time complexities of serial, indeterministic serial and parallel computers and hypercomputers and the specification of a hierarchy of hypercomputers that can hypercompute the truths of all propositions in the standard class model of set theory, the von Neumann hierarchy of pure sets.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference35 articles.
1. Infinite time Turing machines
2. Infinite Time Register Machines;Koepke,2006
3. An enhanced theory of infinite time register machines;Koepke,2008
4. Turing Computations On Ordinals
5. Ordinal computations
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献