982 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
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
Non-Turing computations via Malament-Hogarth space-times
We investigate the Church-Kalm\'ar-Kreisel-Turing Theses concerning
theoretical (necessary) limitations of future computers and of deductive
sciences, in view of recent results of classical general relativity theory.
We argue that (i) there are several distinguished Church-Turing-type Theses
(not only one) and (ii) validity of some of these theses depend on the
background physical theory we choose to use. In particular, if we choose
classical general relativity theory as our background theory, then the above
mentioned limitations (predicted by these Theses) become no more necessary,
hence certain forms of the Church-Turing Thesis cease to be valid (in general
relativity). (For other choices of the background theory the answer might be
different.)
We also look at various ``obstacles'' to computing a non-recursive function
(by relying on relativistic phenomena) published in the literature and show
that they can be avoided (by improving the ``design'' of our future computer).
We also ask ourselves, how all this reflects on the arithmetical hierarchy and
the analytical hierarchy of uncomputable functions.Comment: Final, published version: 25 pages, LaTex with two eps-figures,
journal reference adde
Kolmogorov Complexity in perspective. Part I: Information Theory and Randomnes
We survey diverse approaches to the notion of information: from Shannon
entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov
complexity are presented: randomness and classification. The survey is divided
in two parts in the same volume. Part I is dedicated to information theory and
the mathematical formalization of randomness based on Kolmogorov complexity.
This last application goes back to the 60's and 70's with the work of
Martin-L\"of, Schnorr, Chaitin, Levin, and has gained new impetus in the last
years.Comment: 40 page
Sequential Predictions based on Algorithmic Complexity
This paper studies sequence prediction based on the monotone Kolmogorov
complexity Km=-log m, i.e. based on universal deterministic/one-part MDL. m is
extremely close to Solomonoff's universal prior M, the latter being an
excellent predictor in deterministic as well as probabilistic environments,
where performance is measured in terms of convergence of posteriors or losses.
Despite this closeness to M, it is difficult to assess the prediction quality
of m, since little is known about the closeness of their posteriors, which are
the important quantities for prediction. We show that for deterministic
computable environments, the "posterior" and losses of m converge, but rapid
convergence could only be shown on-sequence; the off-sequence convergence can
be slow. In probabilistic environments, neither the posterior nor the losses
converge, in general.Comment: 26 pages, LaTe
On Resource-bounded versions of the van Lambalgen theorem
The van Lambalgen theorem is a surprising result in algorithmic information
theory concerning the symmetry of relative randomness. It establishes that for
any pair of infinite sequences and , is Martin-L\"of random and
is Martin-L\"of random relative to if and only if the interleaved sequence
is Martin-L\"of random. This implies that is relative random
to if and only if is random relative to \cite{vanLambalgen},
\cite{Nies09}, \cite{HirschfeldtBook}. This paper studies the validity of this
phenomenon for different notions of time-bounded relative randomness.
We prove the classical van Lambalgen theorem using martingales and Kolmogorov
compressibility. We establish the failure of relative randomness in these
settings, for both time-bounded martingales and time-bounded Kolmogorov
complexity. We adapt our classical proofs when applicable to the time-bounded
setting, and construct counterexamples when they fail. The mode of failure of
the theorem may depend on the notion of time-bounded randomness
- …