English

A Universal Hypercomputer

Logic 2019-05-13 v4 Computational Complexity

Abstract

This paper describes a type of infinitary computer (a hypercomputer) capable of computing truth in initial levels of the set theoretic universe, V. The proper class of such hypercomputers is called a universal hypercomputer. There are two basic variants of hypercomputer: a serial hypercomputer and a parallel hypercomputer. The set of computable functions of the two variants is identical but the parallel hypercomputer is in general faster than a serial hypercomputer (as measured by an ordinal complexity measure). Insights into set theory using information theory and a universal hypercomputer are possible, and it is argued that the Generalised Continuum Hypothesis can be regarded as a information-theoretic principle, which follows from an information minimisation principle.

Keywords

Cite

@article{arxiv.1806.08747,
  title  = {A Universal Hypercomputer},
  author = {Andrew Powell},
  journal= {arXiv preprint arXiv:1806.08747},
  year   = {2019}
}

Comments

21 pages, no figures; 2 tables; v2