In this paper, the issues of computability and constructivity in the mathematics of physics are discussed. The sorts of questions to be addressed are those which might be expressed, roughly, as: Are the mathematical foundations of our current theories unavoidably non-constructive: or, Are the laws of physics computable?

The paper is a continuation of another paper published as Part I. Now, the case of “n=3” is inferred as a corollary from the Kochen and Specker theorem (1967): the eventual solutions of Fermat’s equation for “n=3” would correspond to an admissible disjunctive division of qubit into two absolutely independent parts therefore versus the contextuality of any qubit, implied by the Kochen – Specker theorem. Incommensurability (implied by the absence of hidden variables) is considered as dual to quantum contextuality. The (...) relevant mathematical structure is Hilbert arithmetic in a wide sense, in the framework of which Hilbert arithmetic in a narrow sense and the qubit Hilbert space are dual to each other. A few cases involving set theory are possible: (1) only within the case “n=3” and implicitly, within any next level of “n” in Fermat’s equation; (2) the identification of the case “n=3” and the general case utilizing the axiom of choice rather than the axiom of induction. If the former is the case, the application of set theory and arithmetic can remain disjunctively divided: set theory, “locally”, within any level; and arithmetic, “globally”, to all levels. If the latter is the case, the proof is thoroughly within set theory. Thus, the relevance of Yablo’s paradox to the statement of Fermat’s last theorem is avoided in both cases. The idea of “arithmetic mechanics” is sketched: it might deduce the basic physical dimensions of mechanics (mass, time, distance) from the axioms of arithmetic after a relevant generalization, Furthermore, a future Part III of the paper is suggested: FLT by mediation of Hilbert arithmetic in a wide sense can be considered as another expression of Gleason’s theorem in quantum mechanics: the exclusions about (n = 1, 2) in both theorems as well as the validity for all the rest values of “n” can be unified after the theory of quantum information. The availability (respectively, non-availability) of solutions of Fermat’s equation can be proved as equivalent to the non-availability (respectively, availability) of a single probabilistic measure as to Gleason’s theorem. (shrink)

Quantum mechanics admits a “linguistic interpretation” if one equates preliminary any quantum state of some whether quantum entity or word, i.e. a wave function interpret-able as an element of the separable complex Hilbert space. All possible Feynman pathways can link to each other any two semantic units such as words or term in any theory. Then, the causal reasoning would correspond to the case of classical mechanics (a single trajectory, in which any next point is causally conditioned), and the probabilistic (...) reasoning, to the case of quantum mechanics (many Feynman trajectories). Frame semantics turns out to be the natural counterpart of that linguistic interpretation of quantum mechanics. (shrink)

Delineating the framework for a fundamental model of long-range coherence in biological systems is said to rely on principles beyond parameters addressed by current physical science. Just as phenomena of quantum mechanics lay beyond tools of classical Newtonian mechanics we must now enter a 3rd regime of unified field, UF mechanics. In this paper we present a battery of nine empirical protocols for manipulating long-range coherence in complex self-organized living systems (SOLS) in a manner surmounting the Copenhagen Interpretation of quantum (...) uncertainty (space-quantization) thereby allowing empirical access to underlying coherent biophysical principles driving self-organization. Interestingly, while the UF is not indicative of a 5th fundamental force in the usual phenomenal sense of quantal transfer during field interactions; it does however provide an inherent ‘force of coherence’ in an energyless ontological sense by a process called ‘topological switching’ of higher dimensional (HD) brane dynamics. It is this putative inherent property that produces long-range coherence and leads to the possibility of its direct experimental mediation. (shrink)

This paper presents several observations on the connections between information, physics, and computation. In particular, the computing power of quantum computers is examined. Quantum theory is characterized by superimposed states and nonlocal interactions. It is argued that recently studied quantum computers, which are based on local interactions, cannot simulate quantum physics.

Does Nature permit the implementation of behaviours that cannot be simulated computationally? We consider the meaning of physical computation in some detail, and present arguments in favour of physical hypercomputation: for example, modern scientific method does not allow the specification of any experiment capable of refuting hypercomputation. We consider the implications of relativistic algorithms capable of solving the (Turing) Halting Problem. We also reject as a fallacy the argument that hypercomputation has no relevance because non-computable values are indistinguishable from sufficiently (...) close computable approximations. In addition to considering the nature of computability relative to any given physical theory, we can consider the relationship between versions of computability corresponding to different models of physics. Deutsch and Penrose have argued on mathematical grounds that quantum computation and Turing computation have equivalent formal power. We suggest this equivalence is invalid when considered from the physical point of view, by highlighting a quantum computational behaviour that cannot meaningfully be considered feasible in the classical universe. (shrink)

A version of the Church-Turing Thesis states that every effectively realizable physical system can be simulated by Turing Machines (‘Thesis P’). In this formulation the Thesis appears to be an empirical hypothesis, subject to physical falsification. We review the main approaches to computation beyond Turing definability (‘hypercomputation’): supertask, non-well-founded, analog, quantum, and retrocausal computation. The conclusions are that these models reduce to supertasks, i.e. infinite computation, and that even supertasks are no solution for recursive incomputability. This yields that the realization (...) of hypercomputing devices is implausible, and that Thesis P is not essentially different from the standard Church-Turing Thesis. (shrink)

Instead of the usual asymptotic passage from quantum mechanics to classical mechanics when a parameter tended to infinity, a sharp boundary is obtained for the domain of existence of classical reality. The last is treated as separable empirical reality following d'Espagnat, described by a mathematical superstructure over quantum dynamics for the universal wave function. Being empirical, this reality is constructed in terms of both fundamental notions and characteristics of observers. It is presupposed that considered observers perceive the world as a (...) system of collective degrees of freedom that are inherently dissipative because of interaction with thermal degrees of freedom. Relevant problems of foundation of statistical physics are considered. A feasible example is given of a macroscopic system not admitting such classical reality.The article contains a concise survey of some relevant domains: quantum and classical Bell-type inequalities; universal wave function; approaches to quantum description of macroscopic world, with emphasis on dissipation; spontaneous reduction models; experimental tests of the universal validity of the quantum theory. (shrink)

Does what guides a pastry chef stand on par, from the standpoint of contemporary computer science, with what guides a supercomputer? Did Betty Crocker, when telling us how to bake a cake, provide an effective procedure, in the sense of `effective' used in computer science? According to Cleland, the answer in both cases is ``Yes''. One consequence of Cleland's affirmative answer is supposed to be that hypercomputation is, to use her phrase, ``theoretically viable''. Unfortunately, though we applaud Cleland's ``gadfly philosophizing'' (...) (as, in fact, seminal), we believe that unless such a modus operandi is married to formal philosophy, nothing conclusive will be produced (as evidenced by the problems plaguing Cleland's work that we uncover). Herein, we attempt to pull off not the complete marriage for hypercomputation, but perhaps at least the beginning of a courtship that others can subsequently help along. (shrink)

In quantum computation non classical features such as superposition states and entanglement are used to solve problems in new ways, impossible on classical digital computers.We illustrate by Deutsch algorithm how a quantum computer can use superposition states to outperform any classical computer. We comment on the view of a quantum computer as a massive parallel computer and recall Amdahls law for a classical parallel computer. We argue that the view on quantum computation as a massive parallel computation disregards the presence (...) of entanglement in a general quantum computation and the non classical way in which parallel results are combined to obtain the final output. (shrink)

This article argues against the conflation of digital and computational that ails contemporary critical discourse. Searching for a common logic among the three modes of computing (namely analog, digital, and quantum), it ends up finding an answer in the individuating backbone that runs through histories of postal, civic, and technological addresses. Borrowing the concept of addressability from computer science and adapting it to explain procedures of identificatory mapping at large, the article theorizes addressability as a cultural technique that can be (...) traced back to the origins of the modern disciplinary state. In doing so, it not only posits addressability as one of the core operational logics for all computation and an alternative analytic to the digital but also suggests a longer arc of computation that considers the ubiquitous digitality as a mere subset of modern state apparatuses and their urban infrastructures. The article concludes by reflecting on this computational addressability and its relationship with ideological interpellation, proposing computation as a multiscalar assemblage of political techniken. (shrink)

This paper provides the first systematic philosophical analysis of an increasingly important part of modern scientific practice: analogue quantum simulation. We introduce the distinction between `simulation' and `emulation' as applied in the context of two case studies. Based upon this distinction, and building upon ideas from the recent philosophical literature on scientific understanding, we provide a normative framework to isolate and support the goals of scientists undertaking analogue quantum simulation and emulation. We expect our framework to be useful to both (...) working scientists and philosophers of science interested in cutting-edge scientific practice. (shrink)

When Ken Malone investigates a case of something causing mental static across the United States, he is teleported to a world that doesn't exist.

For nearly six decades, the conscious observer has played a central and essential rôle in quantum measurement theory. I outline some difficulties which the traditional account of measurement presents for material theories of mind before introducing a new development which promises to exorcise the ghost of consciousness from physics and relieve the cognitive scientist of the burden of explaining why certain material structures reduce wavefunctions by virtue of being conscious while others do not. The interactive decoherence of complex quantum systems (...) reveals that the oddities and complexities of linear superposition and state vector reduction are irrelevant to computational aspects of the philosophy of mind and that many conclusions in related fields are ill founded. (shrink)

It is demonstrated that one can in principle register an arbitrarily small force acting on a free particle by employing only measurements of its coordinates.

Between Calculability and Non-Calculability. Issues of Calculability and Predictability in the Physics of Complex Systems. The ability to predict has been a very important qualifier of what constitutes scientific knowledge, ever since the successes of Babylonian and Greek astronomy. More recent is the general appreciation of the fact that in the presence of deterministic chaos, predictability is severely limited (the so-called ‘butterfly effect’): Nearby trajectories diverge during time evolution; small errors typically grow exponentially with time. The system obeys deterministic laws (...) and still is unpredictable, seemingly a paradox for the traditional viewpoint of Laplacian determinisms. With the concept of deterministic chaos the epistemological issue about an adequate understanding of predictability is no longer just a mere philosophical topic. Physicists on the one hand recognize the limits of (long term) predictability, computability and even of scientific knowledge, on the other hand they work on concepts for extending the horizon of predictability. It is shown in this paper that physics of complex systems is useful to clarify the jungle of different meanings of the terms ‘predictability’ and ‘computability’ — also with philosophical implications for understanding science and nature. Today, from the physical point of view, the relevance of the concepts of predictability seems to be underestimated by philosophers as a mere methodological topic. In the paper I analyse the importance of predictability and computability in physics of complex systems. I show a way how to cope with problems of unpredictability and noncomputability. Nine different concepts of predictability and computability (i.e. open solution, sensitivity/chaos, redundancy/chance) are presented, compared and evaluated. (shrink)

We establish a connection between measurement-based quantum computation and the field of mathematical logic. We show that the computational power of an important class of quantum states called graph states, representing resources for measurement-based quantum computation, is reflected in the expressive power of (classical) formal logic languages defined on the underlying mathematical graphs. In particular, we show that for all graph state resources which can yield a computational speed-up with respect to classical computation, the underlying graphs—describing the quantum correlations of (...) the states—are associated with undecidable logic theories. Here undecidability is to be interpreted in a sense similar to Gödel’s incompleteness results, meaning that there exist propositions, expressible in the above classical formal logic, which cannot be proven or disproven. (shrink)

We present a historical study of Quantum Technology 2.0 using more than 66,000 papers from 1980 to 2020 that had been assigned to four subfields. We applied the method reference publication year spectroscopy to respective publication sets of the subfields in order to identify their historical roots and seminal papers. We found 126 of them in total, 43 in quantum metrology and sensing, 46 in quantum communication and cryptography, 42 in quantum computing, and 33 in quantum information science–with a significant (...) overlap between subfields–which are all discussed in their relevance for the respective subfield. We compared the subfields regarding their interrelationship and distinctiveness in terms of their most influential papers and were able to deduce a common core set of five seminal publications in all four subfields. (shrink)