- Submit
-
Browse
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- More
Switch to: References
Citations of:
Add citations
You must login to add citations.
|
|
|
In this article we argue for the existence of ‘analogue simulation’ as a novel form of scientific inference with the potential to be confirmatory. This notion is distinct from the modes of analogical reasoning detailed in the literature, and draws inspiration from fluid dynamical ‘dumb hole’ analogues to gravitational black holes. For that case, which is considered in detail, we defend the claim that the phenomena of gravitational Hawking radiation could be confirmed in the case that its counterpart is detected (...) |
|
|
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 (...) |
|
|
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 (...) |
|
|
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. |
|
|
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? |
|
|
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 (...) |
|
|
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 (...) |
|
|
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 (...) |
|
|
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 (...) |
|
|
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 (...) |
|
|
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 (...) |
|
|
|
|
|
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 (...) |
|
|
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'' (...) |
|
|
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 (...) |
|
|
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. |
|
|
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 (...) |
|
|
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. |
|
|
|
|
|
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 (...) |
|
|
|
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6f97f49787-r597v uwo