272 research outputs found
Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals
We describe the basic theory of infinite time Turing machines and some recent
developments, including the infinite time degree theory, infinite time
complexity theory, and infinite time computable model theory. We focus
particularly on the application of infinite time Turing machines to the
analysis of the hierarchy of equivalence relations on the reals, in analogy
with the theory arising from Borel reducibility. We define a notion of infinite
time reducibility, which lifts much of the Borel theory into the class
in a satisfying way.Comment: Submitted to the Effective Mathematics of the Uncountable Conference,
200
Infinitely Complex Machines
Infinite machines (IMs) can do supertasks. A supertask is an infinite series of operations done in some finite time. Whether or not our universe contains any IMs, they are worthy of study as upper bounds on finite machines. We introduce IMs and describe some of their physical and psychological aspects. An accelerating Turing machine (an ATM) is a Turing machine that performs every next operation twice as fast. It can carry out infinitely many operations in finite time. Many ATMs can be connected together to form networks of infinitely powerful agents. A network of ATMs can also be thought of as the control system for an infinitely complex robot. We describe a robot with a dense network of ATMs for its retinas, its brain, and its motor controllers. Such a robot can perform psychological supertasks - it can perceive infinitely detailed objects in all their detail; it can formulate infinite plans; it can make infinitely precise movements. An endless hierarchy of IMs might realize a deep notion of intelligent computing everywhere
A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory
A practical viewpoint links reality, representation, and language to calculation by the concept of Turing (1936) machine being the mathematical model of our computers. After the Gödel incompleteness theorems (1931) or the insolvability of the so-called halting problem (Turing 1936; Church 1936) as to a classical machine of Turing, one of the simplest hypotheses is completeness to be suggested for two ones. That is consistent with the provability of completeness by means of two independent Peano arithmetics discussed in Section I.
Many modifications of Turing machines cum quantum ones are researched in Section II for the Halting problem and completeness, and the model of two independent Turing machines seems to generalize them.
Then, that pair can be postulated as the formal definition of reality therefore being complete unlike any of them standalone, remaining incomplete without its complementary counterpart. Representation is formal defined as a one-to-one mapping between the two Turing machines, and the set of all those mappings can be considered as “language” therefore including metaphors as mappings different than representation. Section III investigates that formal relation of “reality”, “representation”, and “language” modeled by (at least two) Turing machines. The independence of (two) Turing machines is interpreted by means of game theory and especially of the Nash equilibrium in Section IV.
Choice and information as the quantity of choices are involved. That approach seems to be equivalent to that based on set theory and the concept of actual infinity in mathematics and allowing of practical implementations
Representation and Reality by Language: How to make a home quantum computer?
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
Computation Environments, An Interactive Semantics for Turing Machines (which P is not equal to NP considering it)
To scrutinize notions of computation and time complexity, we introduce and
formally define an interactive model for computation that we call it the
\emph{computation environment}. A computation environment consists of two main
parts: i) a universal processor and ii) a computist who uses the computability
power of the universal processor to perform effective procedures. The notion of
computation finds it meaning, for the computist, through his
\underline{interaction} with the universal processor.
We are interested in those computation environments which can be considered
as alternative for the real computation environment that the human being is its
computist. These computation environments must have two properties: 1- being
physically plausible, and 2- being enough powerful.
Based on Copeland' criteria for effective procedures, we define what a
\emph{physically plausible} computation environment is.
We construct two \emph{physically plausible} and \emph{enough powerful}
computation environments: 1- the Turing computation environment, denoted by
, and 2- a persistently evolutionary computation environment, denoted by
, which persistently evolve in the course of executing the computations.
We prove that the equality of complexity classes and
in the computation environment conflicts with the
\underline{free will} of the computist.
We provide an axiomatic system for Turing computability and
prove that ignoring just one of the axiom of , it would not be
possible to derive from the rest of axioms.
We prove that the computist who lives inside the environment , can never
be confident that whether he lives in a static environment or a persistently
evolutionary one.Comment: 33 pages, interactive computation, P vs N
Infinite time decidable equivalence relation theory
We introduce an analog of the theory of Borel equivalence relations in which
we study equivalence relations that are decidable by an infinite time Turing
machine. The Borel reductions are replaced by the more general class of
infinite time computable functions. Many basic aspects of the classical theory
remain intact, with the added bonus that it becomes sensible to study some
special equivalence relations whose complexity is beyond Borel or even
analytic. We also introduce an infinite time generalization of the countable
Borel equivalence relations, a key subclass of the Borel equivalence relations,
and again show that several key properties carry over to the larger class.
Lastly, we collect together several results from the literature regarding Borel
reducibility which apply also to absolutely Delta_1^2 reductions, and hence to
the infinite time computable reductions.Comment: 30 pages, 3 figure
- …