Related papers: A quantum-information-theoretic complement to a ge…
This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…
The most challenging problem of modern physics is how to reconcile quantum theory and general relativity, namely, to find a consistent quantum theory in which gravity is quantized. This Progress Report focuses on such a tentative theory…
We study the paradoxical aspects of closed time-like curves and their impact on the theory of computation. After introducing the $\text{TM}_\text{CTC}$, a classical Turing machine benefiting CTCs for backward time travel, Aaronson et al.…
There have been a number of attempts to derive the set of quantum non-local correlations from reasonable physical principles. Here we introduce $\tilde{Q}$, a set of multipartite supra-quantum correlations that has appeared under different…
Computational complexity has often been ignored in philosophy of mind, in philosophical artificial intelligence studies. The purpose of this paper is threefold. First and foremost, to show the importance of complexity rather than…
This thesis will be focused on the classical capacity of quantum channels, one of the first areas treated by quantum information theorists. The problem is fairly solved since some years. Nevertheless, this work will give me a reason to…
Quantum information theory is the study of the achievable limits of information processing within quantum mechanics. Many different types of information can be accommodated within quantum mechanics, including classical information, coherent…
The quest to understand consciousness, once the purview of philosophers and theologians, is now actively pursued by scientists of many stripes. We examine consciousness from the perspective of theoretical computer science (TCS), a branch of…
What kind of object is a quantum state? Is it an object that encodes an exponentially growing amount of information (in the size of the system) or more akin to a probability distribution? It turns out that these questions are sensitive to…
This is a brief review of the experimental and theoretical quantum computing. The hopes for eventually building a useful quantum computer rely entirely on the so-called "threshold theorem". In turn, this theorem is based on a number of…
In this paper are discussed some formal properties of quantum devices necessary for implementation of nondeterministic Turing machine.
Approaching limitations of digital computing technologies have spurred research in neuromorphic and other unconventional approaches to computing. Here we argue that if we want to systematically engineer computing systems that are based on…
Hypercomputation or super-Turing computation is a ``computation'' that transcends the limit imposed by Turing's model of computability. The field still faces some basic questions, technical (can we mathematically and/or physically build a…
As we begin to reach the limits of classical computing, quantum computing has emerged as a technology that has captured the imagination of the scientific world. While for many years, the ability to execute quantum algorithms was only a…
The notion of computability is stable (i.e. independent of the choice of an indexing) over infinite-dimensional vector spaces provided they have a finite "tensorial dimension". Such vector spaces with a finite tensorial dimension permit to…
The quest to understand consciousness, once the purview of philosophers and theologians, is now actively pursued by scientists of many stripes. This paper studies consciousness from the perspective of theoretical computer science. It…
Many people believe that mysterious phenomenon of consciousness may be connected with quantum features of our world. The present author proposed so-called Extended Everett's Concept (EEC) that allowed to explain consciousness and…
Taking the view that computation is after all physical, we argue that physics, particularly quantum physics, could help extend the notion of computability. Here, we list the important and unique features of quantum mechanics and then…
In The Philosophy of Information (2011 book), Luciano Floridi presents an ontological theory of Being qua Being, which he calls "Informational Structural Realism", a theory which applies, he says, to every possible world. He identifies…
This paper demonstrates the relativity of Computability and Nondeterministic; the nondeterministic is just Turing's undecidable Decision rather than the Nondeterministic Polynomial time. Based on analysis about TM, UM, DTM, NTM, Turing…