What is the source of logical and mathematical truth? This book revitalizes conventionalism as an answer to this question. Conventionalism takes logical and mathematical truth to have their source in linguistic conventions. This was an extremely popular view in the early 20th century, but it was never worked out in detail and is now almost universally rejected in mainstream philosophical circles. Shadows of Syntax is the first book-length treatment and defense of a combined conventionalist theory of logic and mathematics. It (...) argues that our conventions, in the form of syntactic rules of language use, are perfectly suited to explain the truth, necessity, and a priority of logical and mathematical claims, as well as our logical and mathematical knowledge. (shrink)

There exists a growing literature on the so-called physical Church-Turing thesis in a relativistic spacetime setting. The physical Church-Turing thesis is the conjecture that no computing device that is physically realizable can exceed the computational barriers of a Turing machine. By suggesting a concrete implementation of a beyond-Turing computer in a spacetime setting, Istvan Nemeti and Gyula David have shown how an appreciation of the physical Church-Turing thesis necessitates the confluence of mathematical, computational, physical, and indeed cosmological ideas. In this (...) essay, I will honour Istvan's seventieth birthday, as well as his longstanding interest in, and his seminal contributions to, this field going back to as early as 1987 by modestly proposing how the concrete implementation in Nemeti and D\'avid might be complemented by a quantum-information-theoretic communication protocol between the computing device and the logician who sets the beyond-Turing computer a task such as determining the consistency of Zermelo-Fraenkel set theory. This suggests that even the foundations of quantum theory and, ultimately, quantum gravity may play an important role in determining the validity of the physical Church-Turing thesis. (shrink)

We analyse the extent of possible computations following Hogarth ([2004]) conducted in Malament–Hogarth (MH) spacetimes, and Etesi and Németi ([2002]) in the special subclass containing rotating Kerr black holes. Hogarth ([1994]) had shown that any arithmetic statement could be resolved in a suitable MH spacetime. Etesi and Németi ([2002]) had shown that some relations on natural numbers that are neither universal nor co-universal, can be decided in Kerr spacetimes, and had asked specifically as to the extent of computational limits there. (...) The purpose of this note is to address this question, and further show that MH spacetimes can compute far beyond the arithmetic: effectively Borel statements (so hyperarithmetic in second-order number theory, or the structure of analysis) can likewise be resolved: Theorem A. If H is any hyperarithmetic predicate on integers, then there is an MH spacetime in which any query ? n H ? can be computed. In one sense this is best possible, as there is an upper bound to computational ability in any spacetime, which is thus a universal constant of that spacetime. Theorem C. Assuming the (modest and standard) requirement that spacetime manifolds be paracompact and Hausdorff, for any spacetime there will be a countable ordinal upper bound, , on the complexity of questions in the Borel hierarchy computable in it. Introduction 1.1 History and preliminaries Hyperarithmetic Computations in MH Spacetimes 2.1 Generalising SADn regions 2.2 The complexity of questions decidable in Kerr spacetimes An Upper Bound on Computational Complexity for Each Spacetime CiteULike Connotea Del.icio.us What's this? (shrink)

This paper discusses the relevance of supertask computation for the determinacy of arithmetic. Recent work in the philosophy of physics has made plausible the possibility of supertask computers, capable of running through infinitely many individual computations in a finite time. A natural thought is that, if supertask computers are possible, this implies that arithmetical truth is determinate. In this paper we argue, via a careful analysis of putative arguments from supertask computations to determinacy, that this natural thought is mistaken: supertasks (...) are of no help in explaining arithmetical determinacy. (shrink)

Our relationship to the infinite is controversial. But it is widely agreed that our powers of reasoning are finite. I disagree with this consensus; I think that we can, and perhaps do, engage in infinite reasoning. Many think it is just obvious that we can't reason infinitely. This is mistaken. Infinite reasoning does not require constructing infinitely long proofs, nor would it gift us with non-recursive mental powers. To reason infinitely we only need an ability to perform infinite inferences. I (...) argue that we have this ability. My argument looks to our best current theories of inference and considers examples of apparent infinite reasoning. My position is controversial, but if I'm right, our theories of truth, mathematics, and beyond could be transformed. And even if I'm wrong, a more careful consideration of infinite reasoning can only deepen our understanding of thinking and reasoning. -/- (Note for readers: the paper's brief discussion of uniform reflection and omega inconsistency is misleading. The imagined interlocutor's argument makes an assumption about the PA-provability of provability generalizations that, while true for the Godel sentence's instances, is unjustified, in general. This means my position is stronger against this objection than the paper suggests, since omega inconsistent theories are not automatically inconsistent with their uniform reflection principles, you also need to assume the arithmetically true Pi-2 sentences.). (shrink)

Inasmuch as physical theories are formalizable, set theory provides a framework for theoretical physics. Four speculations about the relevance of set theoretical modeling for physics are presented: the role of transcendental set theory (i) in chaos theory, (ii) for paradoxical decompositions of solid three-dimensional objects, (iii) in the theory of effective computability (Church-Turing thesis) related to the possible “solution of supertasks,” and (iv) for weak solutions. Several approaches to set theory and their advantages and disadvatages for physical applications are discussed: (...) Canlorian “naive” (i.e., nonaxiomatic) set theory, contructivism, and operationalism. In the author's opinion, an attitude of “suspended attention” (a term borrowed from psychoanalysis) seems most promising for progress. Physical and set theoretical entities must be operationalized wherever possible. At the same time, physicists should be open to “bizarre” or “mindboggling” new formalisms, which need not be operationalizable or testable at the lime of their creation, but which may successfully lead to novel fields of phenomenology and technology. (shrink)

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)

We describe a possible physical device that computes a function that cannot be computed by a Turing machine. The device is physical in the sense that it is compatible with General Relativity. We discuss some objections, focusing on those which deny that the device is either a computer or computes a function that is not Turing computable. Finally, we argue that the existence of the device does not refute the Church–Turing thesis, but nevertheless may be a counterexample to Gandy's thesis.

1. The Physical Church-Turing Thesis. Physicists often interpret the Church-Turing Thesis as saying something about the scope and limitations of physical computing machines. Although this was not the intention of Church or Turing, the Physical Church Turing thesis is interesting in its own right. Consider, for example, Wolfram’s formulation: One can expect in fact that universal computers are as powerful in their computational capabilities as any physically realizable system can be, that they can simulate any physical system . . . (...) No physically implementable procedure could then shortcut a computationally irreducible process. (Wolfram 1985) Wolfram’s thesis consists of two parts: (a) Any physical system can be simulated (to any degree of approximation) by a universal Turing machine (b) Complexity bounds on Turing machine simulations have physical significance. For example, suppose that the computation of the minimum energy of some system of n particles takes at least exponentially (in n) many steps. Then the relaxation time of the actual physical system to its minimum energy state will also take exponential time. (shrink)

This article defends a modest version of the Physical Church-Turing thesis (CT). Following an established recent trend, I distinguish between what I call Mathematical CT—the thesis supported by the original arguments for CT—and Physical CT. I then distinguish between bold formulations of Physical CT, according to which any physical process—anything doable by a physical system—is computable by a Turing machine, and modest formulations, according to which any function that is computable by a physical system is computable by a Turing machine. (...) I argue that Bold Physical CT is not relevant to the epistemological concerns that motivate CT and hence not suitable as a physical analog of Mathematical CT. The correct physical analog of Mathematical CT is Modest Physical CT. I propose to explicate the notion of physical computability in terms of a usability constraint, according to which for a process to count as relevant to Physical CT, it must be usable by a finite observer to obtain the desired values of a function. Finally, I suggest that proposed counterexamples to Physical CT are still far from falsifying it because they have not been shown to satisfy the usability constraint. (shrink)

This article shows a clear sense in which general relativity allows for a type of ‘machine’ that can bring about a spacetime structure suitable for the implementation of ‘supertasks’. 1Introduction2Preliminaries3Malament–Hogarth Spacetimes4Machines5Malament–Hogarth Machines6Conclusion.

Intuitively, the totality of physical reality—the Cosmos—has a beginning only if (i) all parts of the Cosmos agree on the direction of time (the Direction Condition) and (ii) there is a boundary to the past of all non-initial spacetime points such that there are no spacetime points to the past of the boundary (the Boundary Condition). Following a distinction previously introduced by J. Brian Pitts, the Boundary Condition can be conceived of in two distinct ways: either topologically, i.e., in terms (...) of a closed boundary, or metrically, i.e., in terms of the Cosmos having a finite past. This article proposes that the Boundary Condition should be posed disjunctively, modifies and improves upon the metrical conception of the Cosmos’s beginning in light of a series of surprising yet simple thought experiments, and suggests that the Direction and Boundary Conditions should be thought of as more fundamental to the concept of the Cosmos’s beginning than classical Big Bang cosmology. (shrink)

Presented here is a new result concerning the computational power of so-called SADn computers, a class of Turing-machine-based computers that can perform some non-Turing computable feats by utilising the geometry of a particular kind of general relativistic spacetime. It is shown that SADn can decide n-quantifier arithmetic but not (n+1)-quantifier arithmetic, a result that reveals how neatly the SADn family maps into the Kleene arithmetical hierarchy. Introduction Axiomatising computers The power of SAD computers Remarks regarding the concept of computability.

Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time. By doing so, they provide a natural model of infinitary computability, a theoretical setting for the analysis of the power and limitations of supertask algorithms.

Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time. By doing so, they provide a natural model of infinitary computability, a theoretical setting for the analysis of the power and limitations of supertask algorithms.

We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. Everyset. for example, is decidable by such machines, and the semi-decidable sets form a portion of thesets. Our oracle concept leads to a notion of relative computability for sets of reals and a rich degree structure, stratified by two natural jump operators.

Dans cet article je réponds à deux questions philosophiques soule­vées par la thèse suivante appelée « thèse de l’hyper-calcul » : il est possible de construire physiquement un modèle d’hyper-calcul. La première question est liée aux enjeux de cette thèse. Puisque la construction physique d’un modèle de calcul dépasse le cadre mathématique initial de la théorie de la calculabilité, j expliquerai pourquoi il est nécessaire de construire physiquement un modèle d’hyper-calcul. La seconde question concerne le problème de la vérification : (...) à supposer que l’on dispose d’un modèle d’hyper-calcul construit physiquement, il serait impossible de vérifier que ce modèle calcule une fonction non calculable par machine de Turing. Je proposerai une analyse de ce problème dans le but de montrer qu’il ne remet pas en cause de façon explicite la thèse de l’hyper-calcul. (shrink)

Dans cet article je réponds à deux questions philosophiques soule­vées par la thèse suivante appelée « thèse de l’hyper-calcul » : il est possible de construire physiquement un modèle d’hyper-calcul. La première question est liée aux enjeux de cette thèse. Puisque la construction physique d’un modèle de calcul dépasse le cadre mathématique initial de la théorie de la calculabilité, j expliquerai pourquoi il est nécessaire de construire physiquement un modèle d’hyper-calcul. La seconde question concerne le problème de la vérification : (...) à supposer que l’on dispose d’un modèle d’hyper-calcul construit physiquement, il serait impossible de vérifier que ce modèle calcule une fonction non calculable par machine de Turing. Je proposerai une analyse de ce problème dans le but de montrer qu’il ne remet pas en cause de façon explicite la thèse de l’hyper-calcul. (shrink)

Dans cet article je réponds à deux questions philosophiques soule­vées par la thèse suivante appelée « thèse de l’hyper-calcul » : il est possible de construire physiquement un modèle d’hyper-calcul. La première question est liée aux enjeux de cette thèse. Puisque la construction physique d’un modèle de calcul dépasse le cadre mathématique initial de la théorie de la calculabilité, j expliquerai pourquoi il est nécessaire de construire physiquement un modèle d’hyper-calcul. La seconde question concerne le problème de la vérification : (...) à supposer que l’on dispose d’un modèle d’hyper-calcul construit physiquement, il serait impossible de vérifier que ce modèle calcule une fonction non calculable par machine de Turing. Je proposerai une analyse de ce problème dans le but de montrer qu’il ne remet pas en cause de façon explicite la thèse de l’hyper-calcul. (shrink)

I discuss candidates for definitions of determinism in the context of general relativistic spacetimes, and argue that a definition which does not make recourse to any particular region of spacetime should be preferred over alternatives; one such notion is discussed in detail in the light of various physical examples. The emerging picture of determinism is a pluralist one: sometimes there is no unique way of making our intuitive concept of determinism precise. Instead, what is crucial for assessment of determinism of (...) the theory are auxiliary conditions under which it counts as deterministic or indeterministic, and justification for using them in a given situation. (shrink)

Determinism fails easily if spacetimes with points removed from the spacetime manifold are taken to be physically reasonable representations of a way the world could be according to classical general relativity. I discuss a recently proposed condition for determining which spacetimes have holes—epistemic hole freeness—and show that epistemic hole freeness gives the correct verdict in some non-globally hyperbolic spacetimes with a closed subset removed, certain spacetimes with genuinely indeterministic features count as having an epistemic hole, which implies that the requirement (...) of epistemic hole freeness enforces a form of determinism, and there is a large class of spacetimes that intuitively are radically indeterministic and unphysical due to containing a hole, but are free from epistemic holes. I show that a few natural ways of remedying are not satisfactory. (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)

What are the limits of physical computation? In his ‘Church’s Thesis and Principles for Mechanisms’, Turing’s student Robin Gandy proved that any machine satisfying four idealised physical ‘principles’ is equivalent to some Turing machine. Gandy’s four principles in effect define a class of computing machines (‘Gandy machines’). Our question is: What is the relationship of this class to the class of all (ideal) physical computing machines? Gandy himself suggests that the relationship is identity. We do not share this view. We (...) will point to interesting examples of (ideal) physical machines that fall outside the class of Gandy machines and compute functions that are not Turing-machine computable. (shrink)

A survey of the field of hypercomputation, including discussion of a variety of objections.

Accelerating Turing machines have attracted much attention in the last decade or so. They have been described as “the work-horse of hypercomputation” (Potgieter and Rosinger 2010: 853). But do they really compute beyond the “Turing limit”—e.g., compute the halting function? We argue that the answer depends on what you mean by an accelerating Turing machine, on what you mean by computation, and even on what you mean by a Turing machine. We show first that in the current literature the term (...) “accelerating Turing machine” is used to refer to two very different species of accelerating machine, which we call end-stage-in and end-stage-out machines, respectively. We argue that end-stage-in accelerating machines are not Turing machines at all. We then present two differing conceptions of computation, the internal and the external, and introduce the notion of an epistemic embedding of a computation. We argue that no accelerating Turing machine computes the halting function in the internal sense. Finally, we distinguish between two very different conceptions of the Turing machine, the purist conception and the realist conception; and we argue that Turing himself was no subscriber to the purist conception. We conclude that under the realist conception, but not under the purist conception, an accelerating Turing machine is able to compute the halting function in the external sense. We adopt a relatively informal approach throughout, since we take the key issues to be philosophical rather than mathematical. (shrink)

Accelerating Turing machines are Turing machines of a sort able to perform tasks that are commonly regarded as impossible for Turing machines. For example, they can determine whether or not the decimal representation of contains n consecutive 7s, for any n; solve the Turing-machine halting problem; and decide the predicate calculus. Are accelerating Turing machines, then, logically impossible devices? I argue that they are not. There are implications concerning the nature of effective procedures and the theoretical limits of computability. Contrary (...) to a recent paper by Bringsjord, Bello and Ferrucci, however, the concept of an accelerating Turing machine cannot be used to shove up Searle's Chinese room argument. (shrink)

Recent work on hypercomputation has raised new objections against the Church–Turing Thesis. In this paper, I focus on the challenge posed by a particular kind of hypercomputer, namely, SAD computers. I first consider deterministic and probabilistic barriers to the physical possibility of SAD computation. These suggest several ways to defend a Physical version of the Church–Turing Thesis. I then argue against Hogarth's analogy between non-Turing computability and non-Euclidean geometry, showing that it is a non-sequitur. I conclude that the Effective version (...) of the Church–Turing Thesis is unaffected by SAD computation. (shrink)

Which function is computed by a Turing machine will depend on how the symbols it manipulates are interpreted. Further, by invoking bizarre systems of notation it is easy to define Turing machines that compute textbook examples of uncomputable functions, such as the solution to the decision problem for first-order logic. Thus, the distinction between computable and uncomputable functions depends on the system of notation used. This raises the question: which systems of notation are the relevant ones for determining whether a (...) function is computable? These are the acceptable notations. I argue for a use criterion of acceptability: the acceptable notations for a domain of objects D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {D}}$$\end{document} are the notations that we can use for the usual D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {D}}$$\end{document}-activities. Acceptable notations for natural numbers are ones that we can count with. Acceptable notations for logical formulas are the ones that we can use in inference and logical analysis. And so on. This criterion makes computability a relative notion—whether a function is computable depends on which notations are acceptable, which is relative to our interests and abilities. I argue that this is not a problem, however, since there is independent reason for taking the extension of computable function to be relative to contingent facts. Similarly, the fact that the use criterion makes a mathematical distinction depend on practical concerns is also not a problem because it dovetails with similar phenomena in other areas of computability theory, namely the roles of notation in computation over real numbers and of Extended Church’s Thesis in complexity theory. (shrink)

This article addresses the question whether supertasks are possible within the context of non-relativistic quantum mechanics. The supertask under consideration consists of performing an infinite number of quantum mechanical measurements in a finite amount of time. Recent arguments in the physics literature claim to show that continuous measurements, understood as N discrete measurements in the limit where N goes to infinity, are impossible. I show that there are certain kinds of measurements in quantum mechanics for which these arguments break down. (...) This suggests that there is a new context in which quantum mechanics, in principle, permits the performance of a supertask. (shrink)

In this paper I will argue that Tait’s axiomatic conception of mathematics implies that it is in principle impossible to be justified in believing a mathematical statement without being justified in believing that statement to be provable. I will then show that there are possible courses of experience which would justify acceptance of a mathematical statement without justifying belief that this statement is provable.

Christopher G. Timpson provides the first full-length philosophical treatment of quantum information theory and the questions it raises for our understanding of the quantum world. He argues for an ontologically deflationary account of the nature of quantum information, which is grounded in a revisionary analysis of the concepts of information.

Quantum Information Theory and the Foundations of Quantum Mechanics is a conceptual analysis of one of the most prominent and exciting new areas of physics, providing the first full-length philosophical treatment of quantum information theory and the questions it raises for our understanding of the quantum world. -/- Beginning from a careful, revisionary, analysis of the concepts of information in the everyday and classical information-theory settings, Christopher G. Timpson argues for an ontologically deflationary account of the nature of quantum information. (...) Against what many have supposed, quantum information can be clearly defined (it is not a primitive or vague notion) but it is not part of the material contents of the world. Timpson's account sheds light on the nature of nonlocality and information flow in the presence of entanglement and, in particular, dissolves puzzles surrounding the remarkable process of quantum teleportation. In addition it permits a clear view of what the ontological and methodological lessons provided by quantum information theory are; lessons which bear on the gripping question of what role a concept like information has to play in fundamental physics. Topics discussed include the slogan 'Information is Physical', the prospects for an informational immaterialism (the view that information rather than matter might fundamentally constitute the world), and the status of the Church-Turing hypothesis in light of quantum computation. -/- With a clear grasp of the concept of information in hand, Timpson turns his attention to the pressing question of whether advances in quantum information theory pave the way for the resolution of the traditional conceptual problems of quantum mechanics: the deep problems which loom over measurement, nonlocality and the general nature of quantum ontology. He marks out a number of common pitfalls to be avoided before analysing in detail some concrete proposals, including the radical quantum Bayesian programme of Caves, Fuchs, and Schack. One central moral which is drawn is that, for all the interest that the quantum information-inspired approaches hold, no cheap resolutions to the traditional problems of quantum mechanics are to be had. (shrink)

This paper develops my (BJPS 2009) criticisms of the philosophical significance of a certain sort of infinitary computational process, a hyperloop. I start by considering whether hyperloops suggest that "effectively computable" is vague (in some sense). I then consider and criticise two arguments by Hogarth, who maintains that hyperloops undermine the very idea of effective computability. I conclude that hyperloops, on their own, cannot threaten the notion of an effective procedure.

Las máquinas aceleradas de Turing (ATMs) son dispositivos capaces de ejecutar súper-tareas. Sin embargo, el simple ejercicio de definirlas ha generado varias paradojas. En el presente artículo se definirán las nociones de súper-tarea y ATM de manera exhaustiva y se aclarará qué debe entenderse en un contexto lógico-formal cuando se pregunta por la existencia de un objeto. A partir de la distinción entre posibilidades lógicas y físicas se disolverán las paradojas y se concluirá que las ATMs son posibles y existen (...) como objetos abstractos. (shrink)

This dissertation is concerned with two of the largest questions that we can ask about the nature of physical reality: first, whether physical reality begin to exist and, second, what criteria would physical reality have to fulfill in order to have had a beginning? Philosophers of religion and theologians have previously addressed whether physical reality began to exist in the context of defending the Kal{\'a}m Cosmological Argument (KCA) for theism, that is, (P1) everything that begins to exist has a cause (...) for its beginning to exist, (P2) physical reality began to exist, and, therefore, (C) physical reality has a cause for its beginning to exist. While the KCA has traditionally been used to argue for God's existence, the KCA does not mention God, has been rejected by historically significant Christian theologians such as Thomas Aquinas, and raises perennial philosophical questions -- about the nature and history of physical reality, the nature of time, the nature of causation, and so on -- that should be of interest to all philosophers and, perhaps, all humans. While I am not a religious person, I am interested in the questions raised by the KCA. In this dissertation, I articulate three necessary conditions that physical reality would need to fulfill in order to have had a beginning and argue that, given the current state of philosophical and scientific inquiry, we cannot determine whether physical reality began to exist. -/- Friends of the KCA have sought to defend their view that physical reality began to exist in two distinct ways. As I discuss in chapter 2, the first way in which friends of the KCA have sought to defend their view that physical reality began to exist involves a family of a priori arguments meant to show that, as a matter of metaphysical necessity, the past must be finite. If the past is necessarily finite, then the past history of physical reality is necessarily finite. And if having a finite past suffices for having a beginning, then, since the past history of physical reality is necessarily finite, physical reality necessarily began to exist. I show that the arguments which have been offered thus far for the view that the past is necessarily finite do not succeed. Moreover, as I elaborate on in chapter 5, having a finite past does not suffice for having a beginning. -/- As I discuss in chapter 3, the second way in which friends of the KCA have sought to defend their view that physical reality began to exist involves a family of a posteriori arguments meant to show that we have empirical evidence that physical reality has a finite past history. For example, the big bang is sometimes claimed to have been the beginning of physical reality and, since we have excellent empirical evidence for the big bang, we have excellent empirical evidence for the beginning of physical reality. The big bang can be understood in two ways. On the one hand, the big bang can be understood as a theory about the history and development of the observable universe. Understood in that sense, then I agree that the big bang is supported by excellent empirical evidence and by a scientific consensus. On the other hand, some authors (particularly science popularizers, science journalists, and religious apologists) have wrongly interpreted big bang theory as a theory about the beginning of the whole of physical reality. As I argue, while a beginning of physical reality may be consistent with classical big bang theory, classical big bang theory does not provide good reason for thinking that physical reality began to exist. -/- In part II, I turn to discussing three necessary, but not necessarily sufficient, conditions for physical reality to have a beginning. Before discussing the three conditions, in chapter 4, I introduce three metaphysical accounts of the nature of time (A-theory, B-theory, and C-theory) as well as some formal machinery that will subsequently become useful in the dissertation. I introduce the first of the three conditions in chapter 5. According to the Modal Condition, physical reality began to exist only if, at the closest possible worlds without time, physical reality does not exist. I show that this condition helps us to make sense of various views in both theology and philosophy of physics. In chapter 6}, I introduce the second of my three conditions, the Direction Condition, according to which, roughly, physical reality began to exist only if all space-time points agree about the direction of time, so that all space-time points can agree that physical reality's putative beginning took place in their objective past. In chapter 7, I discuss the third condition, the Boundary Condition, according to which physical reality began to exist only if there is a past temporal boundary such that physical reality did not exist before the boundary. I show that there are two senses in which physical reality could be said to have had a past temporal boundary. Lastly, in chapter 8, I show that there is a relationship between my three conditions and classical big bang theory, even though the relationship is not the one usually identified in the literature. -/- In part III, I present four arguments for the view that, at the present stage of philosophical and scientific inquiry, we cannot know whether physical reality satisfies the three necessary conditions to have had a beginning and, consequently, we cannot know whether physical reality had a beginning. As I will prove in chapter 9, no set of observations that we currently have, when conjoined with General Relativity, entails that physical reality satisfies the Direction or Boundary Conditions. As I show in chapter 10, considerations in the philosophical foundations of statistical mechanics entail either that the Cosmos violates the Modal Condition or else that there is a transcendental condition on the possibility of our knowledge of the past that prevents our access to data we would need to gather to determine whether physical reality satisfies the Boundary Condition. In chapter 11, I show that there are a number of live cosmological models according to which physical reality does not satisfy the Boundary Condition. As long as we don't know whether any of those cosmological models are correct, we do not know whether physical reality satisfies the Boundary Condition. Lastly, I turn to confirmation theory and show that, at our present stage of inquiry, ampliative inferences for the conclusion that physical reality satisfies the Modal, Direction, and Boundary Conditions are not successful. (shrink)

The recent debate on hypercomputation has raised new questions both on the computational abilities of quantum systems and the Church-Turing Thesis role in Physics.We propose here the idea of “effective physical process” as the essentially physical notion of computation. By using the Bohm and Hiley active information concept we analyze the differences between the standard form (quantum gates) and the non-standard one (adiabatic and morphogenetic) of Quantum Computing, and we point out how its Super-Turing potentialities derive from an incomputable information (...) source in accordance with Bell’s constraints. On condition that we give up the formal concept of “universality”, the possibility to realize quantum oracles is reachable. In this way computation is led back to the logic of physical world. (shrink)

The Aleph Zero or Zero Dichotomy is a strong version of Zeno's Dichotomy II which being entirely derived from the topological successiveness of the w-order comes to the same Zeno's absurdity.

We have a conundrum. The physical basis of information is clearly a highly active research area. Yet the power of information theory comes precisely from separating it from the detailed problems of building physical systems to perform information processing tasks. Developments in quantum information over the last two decades seem to have undermined this separation, leading to suggestions that information is itself a physical entity and must be part of our physical theories, with resource-cost implications. We will consider a variety (...) of ways in which physics seems to a affect computation, but will ultimately argue to the contrary: rejecting the claims that information is physical provides a better basis for understanding the fertile relationship between information theory and physics. instead, we will argue that the physical resource costs of information processing are to be understood through the need to consider physically embodied agents for whom information processing tasks are performed. Doing so sheds light on what it takes for something to be implementing a computational or information processing task of a given kind. (shrink)