Representation and Reality by Language: How to make a home quantum computer?

EasyChair Preprint 3371

Abstract

A set theory model of reality, representation and language based on the relation of completeness and incompleteness is explored. The problem of completeness of mathematics is linked to its counterpart in quantum mechanics. That model includes two Peano arithmetics or Turing machines independent of each other. The complex Hilbert space underlying quantum mechanics as the base of its mathematical formalism is interpreted as a generalization of Peano arithmetic: It is a doubled infinite set of doubled Peano arithmetics having a remarkable symmetry to the axiom of choice. The quantity of information is interpreted as the number of elementary choices (bits). Quantum information is seen as the generalization of information to infinite sets or series. The equivalence of that model to a quantum computer is demonstrated. The condition for the Turing machines to be independent of each other is reduced to the state of Nash equilibrium between them. Two relative models of language as game in the sense of game theory and as ontology of metaphors (all mappings, which are not one-to-one, i.e. not representations of reality in a formal sense) are deduced.

Keyphrases: Turing machine, completeness, halting problem, information, language, ncompleteness, quantum computer, quantum information, quantum mechanics, reality, representation

@booklet{EasyChair:3371,
  author    = {Vasil Penchev},
  title     = {Representation and Reality by Language: How to make a home quantum computer?},
  howpublished = {EasyChair Preprint 3371},
  year      = {EasyChair, 2020}}