Related papers: Space and Time Complexity for Infinite Time Turing…
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas. In this paper we show that if CTCs existed, then quantum…
Although the interpretation of complexity in extended theories of gravity is available in the literature, its illustration in $f(R,L_{m},\mathcal{T})$ theory is still ambiguous. The orthogonal decomposition of the Riemann tensor results in…
We use the phenomenological approach to study properties of space-time in the vicinity of the Schwarzschild black-hole singularity. Requiring finiteness of the Schwarzschild-like metrics we come to the notion of integrable singularity that…
Infinite time Turing machines are extended in several ways to allow for iterated oracle calls. The expressive power of these machines is discussed and in some cases determined.
We discuss the question of time in a Bianchi I quantum cosmology in the framework of singularity avoidance. We show that time parameters fall into two distinct classes, that are such that the time development of the wave function either…
We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating $n$-dimensional complexity by using an $n$-dimensional deterministic Turing…
We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra…
There is an important and interesting open question in computational complexity on the relation between the complexity classes $\mathcal{NP}$ and $\mathcal{PSPACE}$. It is a widespread belief that $\mathcal{NP}\ne\mathcal{PSPACE}$. In this…
We investigate the minimum cases for realtime probabilistic machines that can define uncountably many languages with bounded error. We show that logarithmic space is enough for realtime PTMs on unary languages. On binary case, we follow the…
In this paper we initiate the study of the computational complexity of learning linear temporal logic (LTL) formulas from examples. We construct approximation algorithms for fragments of LTL and prove hardness results; in particular we…
This article expands our work in [Ca16]. By its reliance on Turing computability, the classical theory of effectivity, along with effective reducibility and Weihrauch reducibility, is only applicable to objects that are either countable or…
We describe the Turing Machine, list some of its many influences on the theory of computation and complexity of computations, and illustrate its importance.
Quantum complexity measures the difficulty of obtaining a given state starting from a typically unentangled state. In this work, we show that complexity, when defined through the minimization of a Riemannian cost functional over the…
Interval Temporal Logic (ITL) is an established temporal formalism for reasoning about time periods. For over 25 years, it has been applied in a number of ways and several ITL variants, axiom systems and tools have been investigated. We…
We consider dynamical systems for which the spatial extension plays an important role. For these systems, the notions of attractor, epsilon-entropy and topological entropy per unit time and volume have been introduced previously. In this…
We consider how changes in transfinite machine architecture can sometimes alter substantially their capabilities. We approach the subject by answering three open problems touching on: firstly differing halting time considerations for…
In this letter we briefly investigate the mathematical structure of space-time in the framework of discretization. It is shown that the discreteness of space-time may result in a new mechanical system which differ from the usual quantum…
We revisit parallel-innermost term rewriting as a model of parallel computation on inductive data structures and provide a corresponding notion of runtime complexity parametric in the size of the start term. We propose automatic techniques…
Probabilistic Spacetime is a simple generalization of the classical model of spacetime in General Relativity, such that it allows to consider multiple metric field realizations endowed with probabilities. The motivation for such a…
The space-time foam formulas, quoted below in Eqs (1) and (3), express the minimal amount of quantum uncertainty to be introduced into the structure of the Einsteinian space-time in order to make that structure compatible with quantum…