pith. sign in

arxiv: 1806.08747 · v4 · pith:XIF4HVEMnew · submitted 2018-06-22 · 🧮 math.LO · cs.CC

A Universal Hypercomputer

classification 🧮 math.LO cs.CC
keywords hypercomputeruniversalinformationparallelprincipleserialtheoryvariants
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.