Switch to: References

Citations of:

Computability in Quantum Mechanics

In Werner De Pauli-Schimanovich, Eckehart Köhler & Friedrich Stadler (eds.), Vienna Circle Institute Yearbook. Kluwer Academic Publishers. pp. 33-46 (1995)

Add citations

You must login to add citations.
  1. Unrealistic Models for Realistic Computations: How Idealisations Help Represent Mathematical Structures and Found Scientific Computing.Philippos Papayannopoulos - 2020 - Synthese 199 (1-2):249-283.
    We examine two very different approaches to formalising real computation, commonly referred to as “Computable Analysis” and “the BSS approach”. The main models of computation underlying these approaches—bit computation and BSS, respectively—have also been put forward as appropriate foundations for scientific computing. The two frameworks offer useful computability and complexity results about problems whose underlying domain is an uncountable space. Since typically the problems dealt with in physical sciences, applied mathematics, economics, and engineering are also defined in uncountable domains, it (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Constructibility of the Universal Wave Function.Arkady Bolotin - 2016 - Foundations of Physics 46 (10):1253-1268.
    This paper focuses on a constructive treatment of the mathematical formalism of quantum theory and a possible role of constructivist philosophy in resolving the foundational problems of quantum mechanics, particularly, the controversy over the meaning of the wave function of the universe. As it is demonstrated in the paper, unless the number of the universe’s degrees of freedom is fundamentally upper bounded or hypercomputation is physically realizable, the universal wave function is a non-constructive entity in the sense of constructive recursive (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Computing, Modelling, and Scientific Practice: Foundational Analyses and Limitations.Philippos Papayannopoulos - 2018 - Dissertation,
    This dissertation examines aspects of the interplay between computing and scientific practice. The appropriate foundational framework for such an endeavour is rather real computability than the classical computability theory. This is so because physical sciences, engineering, and applied mathematics mostly employ functions defined in continuous domains. But, contrary to the case of computation over natural numbers, there is no universally accepted framework for real computation; rather, there are two incompatible approaches --computable analysis and BSS model--, both claiming to formalise algorithmic (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Hao Wang as Philosopher and Interpreter of Gödel.Charles Parsons - 1998 - Philosophia Mathematica 6 (1):3-24.
    The paper undertakes to characterize Hao Wang's style, convictions, and method as a philosopher, centering on his most important philosophical work From Mathematics to Philosophy, 1974. The descriptive character of Wang's characteristic method is emphasized. Some specific achievements are discussed: his analyses of the concept of set, his discussion, in connection with setting forth Gödel's views, of minds and machines, and his concept of ‘analytic empiricism’ used to criticize Carnap and Quine. Wang's work as interpreter of Gödel's thought and the (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations