Related papers: Uncomputability and physical law
Topological classification of the 4-manifolds bridges computation theory and physics. A proof of the undecidability of the homeomorphy problem for 4-manifolds is outlined here in a clarifying way. It is shown that an arbitrary Turing…
Physical modeling closes the gap between perception in terms of measurements and abstraction in terms of theoretical models. Physical modeling is a major objective in physics and is generally regarded as a creative process. How good are…
Quantum computing relies on processing information within a quantum system with many continuous degrees of freedom. The practical implementation of this idea requires complete control over all of the 2^n independent amplitudes of a…
It is argued that quantum mechanics follows naturally from the assumptions that there are no fundamental causal laws but only probabilities for physical processes that are constrained by symmetries, and reality is relational in the sense…
The accessible information decreases under quantum operations. We analyzed the connection between quantum operations and accessible information. We show that a general quantum process cannot be operated accurately. Futhermore, an unknown…
With the great success in simulating many intelligent behaviors using computing devices, there has been an ongoing debate whether all conscious activities are computational processes. In this paper, the answer to this question is shown to…
Quantum theory provides an extremely accurate description of fundamental processes in physics. It thus seems likely that the theory is applicable beyond the, mostly microscopic, domain in which it has been tested experimentally. Here we…
This work formulates and gives grounds for general principles and theorems that question the energy function doctrine and its quantum version as a genuine law of nature without borders of adequacy. The emphasis is on the domain where the…
According to the Church-Turing Thesis (CTT), effective formal behaviours can be simulated by Turing machines; this has naturally led to speculation that physical systems can also be simulated computationally. But is this wider claim true,…
We discuss the notion about physical quantities as having values represented by real numbers, and its limiting to describe nature to be understood in relation to our appreciation that the quantum theory is a better theory of natural…
The linear mathematics of quantum mechanics gives many versions of reality instead of the single version we perceive, with the perceived version chosen at random according to a probability law. Because of these peculiarities, the theory…
Murphy's Law is $not$ a law in the formal sense yet popular science often compares it with the Second Law of Thermodynamics as both the statements point toward a more disorganized state with time. In this paper, we first construct a…
Energy has an ambiguous status in general relativity. For systems embedded in asymptotically flat space-times it is possible to construct an integral invariant that corresponds to total energy, however there is no local differential…
This article discusses several erroneous claims which appear in textbooks on numerical methods and computational physics. These are not typos or mistakes an individual author has made, but widespread misconceptions. In an attempt to stop…
An essential element of classical computation is the "if-then" construct, that accepts a control bit and an arbitrary gate, and provides conditional execution of the gate depending on the value of the controlling bit. On the other hand,…
A formula to calculate the quantum fluctuations of energy in small subsystems of a hot and relativistic gas is derived. We find an increase in fluctuations for subsystems of small sizes, but we agrees with the energy fluctuations in the…
In quantum gravity there is no notion of absolute time. Like all other quantities in the theory, the notion of time has to be introduced "relationally", by studying the behavior of some physical quantities in terms of others chosen as a…
Quantum computation is a rapidly progressing field today. What are its principles? In what sense is it distinct from conventional computation? What are its advantages and disadvantages? What type of problems can it address? How practical is…
The halting problem is considered to be an essential part of the theoretical background to computing. That halting is not in general computable has supposedly been proved in many text books and taught on many computer science courses, in…
We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as…