相关论文: Measurability and Computability

Quantum physics is surprising in many ways. One surprise is the threat to locality implied by Bell's Theorem. Another surprise is the capacity of quantum computation, which poses a threat to the complexity-theoretic Church-Turing thesis. In…

Quantum measurement is universal for quantum computation. Two models for performing measurement-based quantum computation exist: the one-way quantum computer was introduced by Briegel and Raussendorf, and quantum computation via projective…

Can a Turing Machine simulate the human mind? If the Church-Turing thesis is assumed to be true, then a Turing Machine should be able to simulate the human mind. In this paper, I challenge that assumption by providing strong mathematical…

Shapiro's notations for natural numbers, and the associated desideratum of acceptability - the property of a notation that all recursive functions are computable in it - is well-known in philosophy of computing. Computable structure theory,…

The purpose of this thesis is to make an analysis of the concept of Hypercomputation and of some hypermachines. This thesis is separated in three main parts. We start in the first chapter with an analysis of the concept of Classical…

We propose measurement modeling from the quantitative social sciences as a framework for understanding fairness in computational systems. Computational systems often involve unobservable theoretical constructs, such as socioeconomic status,…

Three notions of complementarity - operational, probabilistic, and value complementarity - are reanalysed with respect to the question of joint measurements and compared with reference to some examples of canonically conjugate observables.…

In this article, we address the problem of how temperature of a quantum system is observed. By proposing a thought experiment, we argue that temperature must be conceived as an operator and its measurement must necessarily accompany a…

Both classical and respectively quantum observables can be modeled as somewhat similar examples of random variables. In such a model the associated measurements preserve the values spectrum of an observable but change the corresponding…

Physical processes are computations only when we use them to externalize thought. Computation is the performance of one or more fixed processes within a contingent environment. We reformulate the Church-Turing thesis so that it applies to…

Quantum computers are believed to bring computational advantages in simulating quantum many body systems. However, recent works have shown that classical machine learning algorithms are able to predict numerous properties of quantum systems…

In contrast with software-generated randomness (called pseudo-randomness), quantum randomness is provable incomputable, i.e.\ it is not exactly reproducible by any algorithm. We provide experimental evidence of incomputability --- an…

Due to common misconceptions about the Church-Turing thesis, it has been widely assumed that the Turing machine provides an upper bound on what is computable. This is not so. The new field of hypercomputation studies models of computation…

The predictions that quantum theory makes about the outcomes of measurements are generally probabilistic. This has raised the question whether quantum theory can be considered complete, or whether there could exist alternative theories that…

This paper addresses the question whether a variant of a modal interpretation is conceivable that could accommodate property ascriptions associated with nonorthogonal resolutions of the unity and nonorthogonal families of relative states as…

We investigate the role of coherence and Markovianity in finding an answer to the question whether the outcomes of a projectively measured quantum stochastic process are compatible with a classical stochastic process. For this purpose we…

If the no-signalling principle was the only limit to the strength of non-local correlations, we would expect that any form of no-signalling correlation can indeed be realized. That is, there exists a state and measurements that remote…

The usual notion of separability has to be reconsidered when applied to states describing identical particles. A definition of separability not related to any a priori Hilbert space tensor product structure is needed: this can be given in…

In this article, we investigate the arithmetical hierarchy from the perspective of realizability theory. An experimental observation in classical computability theory is that the notion of degrees of unsolvability for natural arithmetical…

The usual conjectures of quantum measurements approaches, inspired from the traditional interpretation of Heisenberg's ("uncertainty") relations, are proved as being incorrect. A group of reconsidered conjectures and a corresponding new…