The birth, growth, stabilization and subsequent understanding of a new field of practical and theoretical enquiry is always a conceptual process including several typologies of events, phenomena an...

In 1931 Kurt Gödel published his incompleteness results, and some years later Church and Turing showed that the decision problem for certain systems of symbolic logic has a negative solution. However, already in 1921 the young logician Emil Post worked on similar problems which resulted in what he called an “anticipation” of these results. For several reasons though he did not submit these results to a journal until 1941. This failure ‘to be the first’, did not discourage him: his contributions (...) to mathematical logic and its foundations should not be underestimated. It is the purpose of this article to show that an interest in the early work of Emil Post should be motivated not only by this historical fact, but also by the fact that Post’s approach and method differs substantially from those offered by Gödel, Turing and Church. In this paper it will be shown how this method evolved in his early work and how it finally led him to his results. (shrink)

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)

Physicalism is the default position in science and in the philosophy of mind, but it should not be, I argue, because of two errors. By its epistemological error, physicalism gives physics priority over the evidence of first person experience. Only what I experience in first person is certain, so observation is prior to any theory. Physics itself is based on observation, avoiding the epistemological error, and then physics can progress, even changing its own ontology. However, physicalism imposes the ontology of (...) physics on every science, and in physics everything is causal. By its ontological error, physicalism tries to explain causally what is intentional. And it happens that causality and intentionality are mutually exclusive, showing that the ontology of physics is insufficient wherever intentions are present. This ontological insufficiency prevents that physicalism can repeat the success of physics with any science where intentions play a rôle, and thus it is blocking the advance of both the social sciences and the philosophy of mind. To overcome this obstacle, I propose to go back to the essentials: we should consider again the transcendental problem raised by Descartes and its solutions by Hume and Kant. On top of this subjectivist solution, we should take advantage of Darwin and Turing, and we should extend our ontology beyond causality to include intentionality, and here my proposal is problem solving. Then you could join our Post-Kantian subjectivism and say with me: The world is not a huge machine, as physicalism proposes, but an enigmatic problem. (shrink)

Fetzer famously claims that program verification is not even a theoretical possibility, and offers a certain argument for this far-reaching claim. Unfortunately for Fetzer, and like-minded thinkers, this position-argument pair, while based on a seminal insight that program verification, despite its Platonic proof-theoretic airs, is plagued by the inevitable unreliability of messy, real-world causation, is demonstrably self-refuting. As I soon show, Fetzer is like the person who claims: ‘My sole claim is that every claim expressed by an English sentence and (...) starting with the phrase “My sole claim” is false’. Or, more accurately, such thinkers are like the person who claims that modus tollens is invalid, and supports this claim by giving an argument that itself employs this rule of inference. (shrink)

Philosophy of science is positioned to make distinctive contributions to cognitive science by providing perspective on its conceptual foundations and by advancing normative recommendations. The philosophy of science I embrace is naturalistic in that it is grounded in the study of actual science. Focusing on explanation, I describe the recent development of a mechanistic philosophy of science from which I draw three normative consequences for cognitive science. First, insofar as cognitive mechanisms are information-processing mechanisms, cognitive science needs an account of (...) how the representations invoked in cognitive mechanisms carry information about contents, and I suggest that control theory offers the needed perspective on the relation of representations to contents. Second, I argue that cognitive science requires, but is still in search of, a catalog of cognitive operations that researchers can draw upon in explaining cognitive mechanisms. Last, I provide a new perspective on the relation of cognitive science to brain sciences, one which embraces both reductive research on neural components that figure in cognitive mechanisms and a concern with recomposing higher-level mechanisms from their components and situating them in their environments. (shrink)

Philosophy of science is positioned to make distinctive contributions to cognitive science by providing perspective on its conceptual foundations and by advancing normative recommendations. The philosophy of science I embrace is naturalistic in that it is grounded in the study of actual science. Focusing on explanation, I describe the recent development of a mechanistic philosophy of science from which I draw three normative consequences for cognitive science. First, insofar as cognitive mechanisms are information‐processing mechanisms, cognitive science needs an account of (...) how the representations invoked in cognitive mechanisms carry information about contents, and I suggest that control theory offers the needed perspective on the relation of representations to contents. Second, I argue that cognitive science requires, but is still in search of, a catalog of cognitive operations that researchers can draw upon in explaining cognitive mechanisms. Last, I provide a new perspective on the relation of cognitive science to brain sciences, one which embraces both reductive research on neural components that figure in cognitive mechanisms and a concern with recomposing higher‐level mechanisms from their components and situating them in their environments. (shrink)

This article is a methodological discussion of formal approaches to the question of identity of proofs from a philosophical standpoint. First, an introduction to the question of identity of proofs itself is given, followed by a brief reconstruction of the so-called normalisation thesis, proposed by Dag Prawitz in 1971, in which some of its core mathematical and conceptual traits are presented. After that, a comparison between the normalisation thesis and the more well-known Church-Turing thesis on computability is carried out in (...) three main parts: the first dedicated to highlighting some of the analogies between them; the second, their most remarkable differences; and the third, to the possible relations of dependence between the two. Based on these considerations, some concluding remarks concerning the potential of the normalisation thesis and similar approaches to the question of identity of proofs are made in the last section. (shrink)

Over the past decades, due to the course towards digitalization of all areas of life, interest in modeling and creating intelligent systems has increased significantly. However, there are now a stagnation in the industry, a lack of attention to analog and bionic approaches as alternatives to digital, numerous speculations on “neuro” issues for commercial and other purposes, and an increase in social and environmental risks. The article provides an overview of the development of artificial intelligence (AI) conceptions toward increasing the (...) human likeness of machines: from the key ideas of A. Turing and J. von Neumann, who initiated the digitalization of society, to discussions about the definition of AI and the emergence of conceptions of strong and weak AI. Special attention is paid to the approach of A. Sloman, to ideas about the architecture and design of complex artificial systems are considered, which make it possible to “emotionally” expand the idea of weak/strong AI. In the article's section on the necessity and possibility of incorporating emotions into the architecture of AI, the authors reveal the goals and methodological limitations for creating an emotional artificial agent. In addition, the article briefly presents the main principles of the authors' architectural approach to the creation of emotional intellectual systems on the example of the cognitive-affective model of architecture, which allow modeling the impact of emotions on the cognitive processes involved in decision-making processes. The described architectural approach to modeling intelligent systems can be used as a conceptual basis for discussing and formulating a strategy for the development of neurocomputing, philosophy of artificial intelligence, and experimental philosophy, for developing innovative research programs, formulating and solving theoretical and methodological problems. (shrink)

The ‘received view’ of the analog–digital distinction holds that analog representations are continuous while digital representations are discrete. In this paper I first provide support for the received view by showing how it (1) emerges from the theory of computation, and (2) explains engineering practices. Second, I critically assess several recently offered alternatives, arguing that to the degree they are justified they demonstrate not that the received view is incorrect, but rather that distinct senses of the terms have become entrenched (...) specific fields, perhaps most notably in the cognitive psychology of mental imagery. (shrink)

The recognition that human minds/brains are finite systems with limited resources for computation has led some researchers to advance theTractable Cognition thesis: Human cognitive capacities are constrained by computational tractability. This thesis, if true, serves cognitive psychology by constraining the space of computational‐level theories of cognition. To utilize this constraint, a precise and workable definition of “computational tractability” is needed. Following computer science tradition, many cognitive scientists and psychologists define computational tractability as polynomial‐time computability, leading to theP‐Cognition thesis. This article (...) explains how and why the P‐Cognition thesis may be overly restrictive, risking the exclusion of veridical computational‐level theories from scientific investigation. An argument is made to replace the P‐Cognition thesis by theFPT‐Cognition thesisas an alternative formalization of the Tractable Cognition thesis (here, FPT stands for fixed‐parameter tractable). Possible objections to the Tractable Cognition thesis, and its proposed formalization, are discussed, and existing misconceptions are clarified. (shrink)

Since the birth of computing as an academic discipline, the disciplinary identity of computing has been debated fiercely. The most heated question has concerned the scientific status of computing. Some consider computing to be a natural science and some consider it to be an experimental science. Others argue that computing is bad science, whereas some say that computing is not a science at all. This survey article presents viewpoints for and against computing as a science. Those viewpoints are analyzed against (...) basic positions in the philosophy of science. The article aims at giving the reader an overview, background, and a historical and theoretical frame of reference for understanding and interpreting some central questions in the debates about the disciplinary identity of computer science. The article argues that much of the discussion about the scientific nature of computing is misguided due to a deep conceptual uncertainty about science in general as well as computing in particular. (shrink)

In his famous paper, An Unsolvable Problem of Elementary Number Theory, Alonzo Church identified the intuitive notion of effective calculability with the mathematically precise notion of recursiveness. This proposal, known as Church's Thesis, has been widely accepted. Only a few papers have been written against it. One of these is László Kalmár's An Argument Against the Plausibility of Church's Thesis from 1959. The aim of this paper is to present Kalmár's argument and to fill in missing details based on his (...) general philosophical thoughts on mathematics. (shrink)

The purpose of this article is to examine aspects of the development of the concept and theory of computability through the theory of recursive functions. Following a brief introduction, Section 2 is devoted to the presuppositions of computability. It focuses on certain concepts, beliefs and theorems necessary for a general property of computability to be formulated and developed into a mathematical theory. The following two sections concern situations in which the presuppositions were realized and the theory of computability was developed. (...) It is suggested in Section 3 that a central item was the problem of generalizing Gödel's incompleteness theorem. It is shown that this involved both the characterization of recursiveness and the attempt to clarify and formulate the notion of an effective process as it relates to the syntax of deductive systems. Section 4 concerns the decision problems which grew from the Hilbert program. Section 5 is devoted to the development of an informal' technique in the theory of computability often called ?argument by Church's thesis? (shrink)

We begin with the history of the discovery of computability in the 1930’s, the roles of Gödel, Church, and Turing, and the formalisms of recursive functions and Turing automatic machines . To whom did Gödel credit the definition of a computable function? We present Turing’s notion [1939, §4] of an oracle machine and Post’s development of it in [1944, §11], [1948], and finally Kleene-Post [1954] into its present form. A number of topics arose from Turing functionals including continuous functionals on (...) Cantor space and online computations. Almost all the results in theoretical computability use relative reducibility and o-machines rather than a-machines and most computing processes in the real world are potentially online or interactive. Therefore, we argue that Turing o-machines, relative computability, and online computing are the most important concepts in the subject, more so than Turing a-machines and standard computable functions since they are special cases of the former and are presented first only for pedagogical clarity to beginning students. At the end in §10–§13 we consider three displacements in computability theory, and the historical reasons they occurred. Several brief conclusions are drawn in §14. (shrink)

We consider the informal concept of "computability" or "effective calculability" and two of the formalisms commonly used to define it, "(Turing) computability" and "(general) recursiveness". We consider their origin, exact technical definition, concepts, history, general English meanings, how they became fixed in their present roles, how they were first and are now used, their impact on nonspecialists, how their use will affect the future content of the subject of computability theory, and its connection to other related areas. After a careful (...) historical and conceptual analysis of computability and recursion we make several recommendations in section §7 about preserving the intensional differences between the concepts of "computability" and "recursion." Specifically we recommend that: the term "recursive" should no longer carry the additional meaning of "computable" or "decidable;" functions defined using Turing machines, register machines, or their variants should be called "computable" rather than "recursive;" we should distinguish the intensional difference between Church's Thesis and Turing's Thesis, and use the latter particularly in dealing with mechanistic questions; the name of the subject should be "Computability Theory" or simply Computability rather than "Recursive Function Theory.". (shrink)

Alonzo Church's mathematical work on computability and undecidability is well-known indeed, and we seem to have an excellent understanding of the context in which it arose. The approach Church took to the underlying conceptual issues, by contrast, is less well understood. Why, for example, was "Church's Thesis" put forward publicly only in April 1935, when it had been formulated already in February/March 1934? Why did Church choose to formulate it then in terms of Gödel's general recursiveness, not his own λ (...) -definability as he had done in 1934? A number of letters were exchanged between Church and Paul Bernays during the period from December 1934 to August 1937; they throw light on critical developments in Princeton during that period and reveal novel aspects of Church's distinctive contribution to the analysis of the informal notion of effective calculability. In particular, they allow me to give informed, though still tentative answers to the questions I raised; the character of my answers is reflected by an alternative title for this paper, Why Church needed Gödel's recursiveness for his Thesis. In Section 5, I contrast Church's analysis with that of Alan Turing and explore, in the very last section, an analogy with Dedekind's investigation of continuity. (shrink)

The article investigates the mathematical and philosophical backdrop of the digital ocean as contemporary model, moving from the digitalized ocean of Georg Cantor’s set theory to that of Alan Turing’s computation theory. It examines in Cantor what is arguably the most rigorous historical attempt to think the structural essence of the continuum, in order to clarify what disappears from the computational paradigm once Turing begins to advocate for the structural irrelevance of this ancient ground.

It is commonly believed that there is no equivalent of the Church–Turing thesis for computation over the reals. In particular, computational models on this domain do not exhibit the convergence of formalisms that supports this thesis in the case of integer computation. In the light of recent philosophical developments on the different meanings of the Church–Turing thesis, and recent technical results on analog computation, I will show that this current belief confounds two distinct issues, namely the extension of the notion (...) of effective computation to the reals on the one hand, and the simulation of analog computers by Turing machines on the other hand. I will argue that it is possible in both cases to defend an equivalent of the Church–Turing thesis over the reals. Along the way, we will learn some methodological caveats on the comparison of different computational models, and how to make it meaningful. (shrink)

In 1931 Kurt Gödel published his incompleteness results, and some years later Church and Turing showed that the decision problem for certain systems of symbolic logic has a negative solution. However, already in 1921 the young logician Emil Post worked on similar problems which resulted in what he called an "anticipation" of these results. For several reasons though he did not submit these results to a journal until 1941. This failure 'to be the first', did not discourage him: his contributions (...) to mathematical logic and its foundations should not be underestimated. It is the purpose of this article to show that an interest in the early work of Emil Post should be motivated not only by this historical fact, but also by the fact that Post's approach and method differs substantially from those offered by Gödel, Turing and Church. In this paper it will be shown how this method evolved in his early work and how it finally led him to his results. (shrink)

The paper examines the roots of Husserlian phenomenology in Weierstrass's approach to analysis. After elaborating on Weierstrass's programme of arithmetization of analysis, the paper examines Husserl's Philosophy of Arithmetic as an attempt to provide foundations to analysis. The Philosophy of Arithmetic consists of two parts; the first discusses authentic arithmetic and the second symbolic arithmetic. Husserl's novelty is to use Brentanian descriptive analysis to clarify the fundamental concepts of arithmetic in the first part. In the second part, he founds the (...) symbolic extension of the authentically given arithmetic with stepwise symbolic operations. In the process of doing so, Husserl comes close to defining the modern concept of computability. The paper concludes with a brief comparison between Husserl and Frege. While Frege chose to subject arithmetic to logical analysis, Husserl wants to clarify arithmetic as it is given to us. Both engage in a kind of analysis, but while Frege analyses within Begriffsschrift, Husserl analyses our experiences. The difference in their methods of analysis is what ultimately grows into two separate schools in philosophy in the 20th century. (shrink)

Current orthodoxy takes representation to be essential to computation. However, a philosophical account of computation that does not appeal to representation would be useful, given the difficulties involved in successfully theorizing representation. Piccinini's recent mechanistic account of computation proposes to do just that: it couches computation in terms of what certain mechanisms do without requiring the manipulation or processing of representations whatsoever (Piccinini 2015). Most crucially, mechanisms must process medium-independent vehicles. There are two ways to understand what "medium-independence" means on (...) this account; however, on either understanding, the account fails. Either too many things end up being counted as computational, or purportedly natural computations (e.g., neural computations) cannot be counted at all. In the end, illustrating this failure sheds some light on the way to revise the orthodoxy in the hope of a better account of computation. (shrink)

In 1935/1936 Kurt Gödel wrote three notebooks on the foundations of quantum mechanics, which have now been entirely transcribed for the first time. Whereas a lot of the material is rather technical in character, many of Gödel's remarks have a philosophical background and concentrate on Leibnizian monadology as well as on vitalism. Obviously influenced by the vitalistic writings of Hans Driesch and his ‘proofs’ for the existence of an entelechy in every living organism, Gödel briefly develops the idea of a (...) computing machine which closely resembles Turing's groundbreaking conception. After introducing the notebooks on quantum mechanics, this article describes Gödel's vitalistic Weltbild and the ideas leading to the development of his computing machine. It investigates a notion of lawlike sequence which closely resembles Turing's concept of a computable number and which Gödel himself calls ‘problematic’, and compares it to the opposed concept of randomness, drawing upon the notion of program-size complexity. Finally, Gödel's machine is implemented in a dialect of the Lisp programing language. (shrink)

A. M. Turing has bequeathed us a conceptulary including 'Turing, or Turing-Church, thesis', 'Turing machine', 'universal Turing machine', 'Turing test' and 'Turing structures', plus other unnamed achievements. These include a proof that any formal language adequate to express arithmetic contains undecidable formulas, as well as achievements in computer science, artificial intelligence, mathematics, biology, and cognitive science. Here it is argued that these achievements hang together and have prospered well in the 50 years since Turing's death.

As an undergraduate I was taught to multiply two numbers with the help of log tables, using the formulaHaving graduated to teach calculus to Engineers, I learned that log tables were to be replaced by slide rules. It was then that Imade the fateful decision that there was no need for me to learn how to use this tedious device, as I could always rely on the students to perform the necessary computations. In the course of time, slide rules were (...) replaced by pocket calculators and personal computers, but I stuck to my original decision.My computer phobia did not prevent me from taking an interest in the theoretical question: what is a computation? This question goes back to Hilbert's 10th problem, which asks for an algorithm, or computational procedure, to decide whether any given polynomial equation is solvable in integers. It quickly leads to the related question: which numerical functionsf: ℕn→ ℕ are computable?While Hilbert's 10th problem was only resolved in 1970, this related question had some earlier answers, of which I shall single out the following three:f is recursive,f is computable on an abstract machine,f is definable in the untyped λ-calculus.These tentative answers were shown to be equivalent by Church [1936] and Turing [1936–7].I shall discuss here some of the more recent developments of these notions of computability and their relevance to linguistics and logic. I hope to be forgiven for dwelling on some of the work I have been involved with personally, with greater emphasis than is justified by its historical significance. (shrink)

In his introductory paper to first-order logic, Jon Barwise writes in the Handbook of Mathematical Logic :[T]he informal notion of provable used in mathematics is made precise by the formal notion provable in first-order logic. Following a sug[g]estion of Martin Davis, we refer to this view as Hilbert’s Thesis.This paper reviews the discussion of Hilbert’s Thesis in the literature. In addition to the question whether it is justifiable to use Hilbert’s name here, the arguments for this thesis are compared with (...) those for Church’s Thesis concerning computability. This leads to the question whether one could provide an analogue for proofs of the concept of partial recursive function. (shrink)

A. N. Turing’s 1936 concept of computability, computing machines, and computable binary digital sequences, is subject to Turing’s Cardinality Paradox. The paradox conjoins two opposed but comparably powerful lines of argument, supporting the propositions that the cardinality of dedicated Turing machines outputting all and only the computable binary digital sequences can only be denumerable, and yet must also be nondenumerable. Turing’s objections to a similar kind of diagonalization are answered, and the implications of the paradox for the concept of a (...) Turing machine, computability, computable sequences, and Turing’s effort to prove the unsolvability of the Entscheidungsproblem, are explained in light of the paradox. A solution to Turing’s Cardinality Paradox is proposed, positing a higher geometrical dimensionality of machine symbol-editing information processing and storage media than is available to canonical Turing machine tapes. The suggestion is to add volume to Turing’s discrete two-dimensional machine tape squares, considering them instead as similarly ideally connected massive three-dimensional machine information cells. Three-dimensional computing machine symbol-editing information processing cells, as opposed to Turing’s two-dimensional machine tape squares, can take advantage of a denumerably infinite potential for parallel digital sequence computing, by which to accommodate denumerably infinitely many computable diagonalizations. A three-dimensional model of machine information storage and processing cells is recommended on independent grounds as better representing the biological realities of digital information processing isomorphisms in the three-dimensional neural networks of living computers. (shrink)

Husserl’s notion of definiteness, i.e., completeness is crucial to understanding Husserl’s view of logic, and consequently several related philosophical views, such as his argument against psychologism, his notion of ideality, and his view of formal ontology. Initially Husserl developed the notion of definiteness to clarify Hermann Hankel’s ‘principle of permanence’. One of the first attempts at formulating definiteness can be found in the Philosophy of Arithmetic, where definiteness serves the purpose of the modern notion of ‘soundness’ and leads Husserl to (...) a ‘computational’ view of logic. Inspired by Gauss and Grassmann Husserl then undertakes a further investigation of theories of manifolds. When Husserl subsequently renounces psychologism and changes his view of logic, his idea of definiteness also develops. The notion of definiteness is discussed most extensively in the pair of lectures Husserl gave in front of the mathematical society in Göttingen (1901). A detailed analysis of the lectures, together with an elaboration of Husserl’s lectures on logic beginning in 1895, shows that Husserl meant by definiteness what is today called ‘categoricity’. In so doing Husserl was not doing anything particularly original; since Dedekind’s ‘Was sind und sollen die Zahlen’ (1888) the notion was ‘in the air’. It also characterizes Hilbert’s (1900) notion of completeness. In the end, Husserl’s view of definiteness is discussed in light of Gödel’s (1931) incompleteness results. (shrink)

Information processing theories in psychology give rise to executive theories of consciousness. Roughly speaking, these theories maintain that consciousness is a centralized processor that we use when processing novel or complex stimuli. The computational assumptions driving the executive theories are closely tied to the computer metaphor. However, those who take the metaphor serious — as I believe psychologists who advocate the executive theories do — end up accepting too particular a notion of a computing device. In this essay, I examine (...) the arguments from theoretical computational considerations that cognitive psychologists use to support their general approach in order to show that they make unwarranted assumptions about the processing attributes of consciousness. I then go on to examine the assumptions behind executive theories which grow out of the computer metaphor of cognitive psychology and conclude that we may not be the sort of computational machine cognitive psychology assumes and that cognitive psychology''s approach in itself does not buy us anything in developing theories of consciousness. Hence, the state space in which we may locate consciousness is vast, even within an information processing framework. (shrink)

An investigation of the concept of “surveyability” as traced through the thought of Hilbert, Wittgenstein, and Turing. The communicability and reproducibility of proof, with certainty, are seen as earmarked by the “surveyability” of symbols, sequences, and structures of proof in all these thinkers. Hilbert initiated the idea within his metamathematics, Wittgenstein took up a kind of game formalism in the 1920s and early 1930s in response. Turing carried Hilbert’s conception of the “surveyability” of proof in metamathematics through into his analysis (...) of what a formal system (what a step in a computation) is in “On computable numbers, with an application to the Entscheidungsproblem” (1936). Wittgenstein’s 1939 investigations of the significance of surveyability to the concept of “proof “in Principia Mathematica were influenced, both by Turing’s remarkable everyday analysis of the Hilbertian idea, and by conversations with Turing. Although Turing does not use the word “surveyability” explicitly, it is clear that the Hilbertian idea plays a recurrent role in his work, refracted through his engagement with Wittgenstein’s idea of a “language-game”. This is evinced in some of his later writings, where the “reform” of mathematical notation for the sake of human surveyability (1944/45) may be seen to draw out the Hilbertian idea. For Turing, as for Wittgenstein, the need for “surveyability” earmarks the evolving culture of humans located in an evolving social and scientific world, just as it had for Hilbert. (shrink)

Alonzo Church (1903–1995) was a renowned mathematical logician, philosophical logician, philosopher, teacher and editor. He was one of the founders of the discipline of mathematical logic as it developed after Cantor, Frege and Russell. He was also one of the principal founders of the Association for Symbolic Logic and the Journal of Symbolic Logic. The list of his students, mathematical and philosophical, is striking as it contains the names of renowned logicians and philosophers. In this article, we focus primarily on (...) Church’s philosophical contributions. (For an account of his life and academic history see the Introduction to The Collected Works of Alonzo Church (2019).) However, we also discuss his mathematical results when it is desirable to do so in order to pursue a philosophical issue. (shrink)

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 (...) computation and to offer foundations for scientific computing. The dissertation consists of three parts. In the first part, we examine what notion of 'algorithmic computation' underlies each approach and how it is respectively formalised. It is argued that the very existence of the two rival frameworks indicates that 'algorithm' is not one unique concept in mathematics, but it is used in more than one way. We test this hypothesis for consistency with mathematical practice as well as with key foundational works that aim to define the term. As a result, new connections between certain subfields of mathematics and computer science are drawn, and a distinction between 'algorithms' and 'effective procedures' is proposed. In the second part, we focus on the second goal of the two rival approaches to real computation; namely, to provide foundations for scientific computing. We examine both frameworks in detail, what idealisations they employ, and how they relate to floating-point arithmetic systems used in real computers. We explore limitations and advantages of both frameworks, and answer questions about which one is preferable for computational modelling and which one for addressing general computability issues. In the third part, analog computing and its relation to analogue (physical) modelling in science are investigated. Based on some paradigmatic cases of the former, a certain view about the nature of computation is defended, and the indispensable role of representation in it is emphasized and accounted for. We also propose a novel account of the distinction between analog and digital computation and, based on it, we compare analog computational modelling to physical modelling. It is concluded that the two practices, despite their apparent similarities, are orthogonal. (shrink)

Computation and information processing are among the most fundamental notions in cognitive science. They are also among the most imprecisely discussed. Many cognitive scientists take it for granted that cognition involves computation, information processing, or both – although others disagree vehemently. Yet different cognitive scientists use ‘computation’ and ‘information processing’ to mean different things, sometimes without realizing that they do. In addition, computation and information processing are surrounded by several myths; first and foremost, that they are the same thing. In (...) this paper, we address this unsatisfactory state of affairs by presenting a general and theory-neutral account of computation and information processing. We also apply our framework by analyzing the relations between computation and information processing on one hand and classicism and connectionism on the other. We defend the relevance to cognitive science of both computation, in a generic sense that we fully articulate for the first time, and information processing, in three important senses of the term. Our account advances some foundational debates in cognitive science by untangling some of their conceptual knots in a theory-neutral way. By leveling the playing field, we pave the way for the future resolution of the debates’ empirical aspects. (shrink)

This paper defends two claims about the criterion of commitment of W.V.O Quine. The first claim is that the criterion can be made extensional. The second is that a proper formulation becomes an analytic truth. We spend a few preliminary sections clarifying our intended notion of ontological commitment. We will not go very far in our investigation of the criterion if we do not distinguish the things a theory postulates, what its adherents, or anybody else, believe in, and which of (...) these entities we have compelling reasons to accept. A look at [Quine 1953] shows that the criterion concerned the postulation of entities by theories, but it is often misread as an attempt to say something about either or. The core of the paper is an exposition of two formulations of the criterion. I first state a schema improving on that of [Scheffler and Chomsky 1959]. The second formulation is a single principle and construes commitment as a relation between theories and predicates: ontological commitment to the entities that satisfy a given predicate. Both criteria are extensional and are formulated for constructional systems, in the sense of [Carnap 1928] and [Goodman 1951], rather than for theories construed as interpreted sets of sentences. This solves a problem raised by [Halvorson 2019]. Their analyticity is substantiated by showing that their most controversial consequences are instances of Tarski’s Convention. (shrink)

After a brief review of ontic and epistemic descriptions, and of subjective, logical and statistical interpretations of probability, we summarize the traditional axiomatization of calculus of probability in terms of Boolean algebras and its set-theoretical realization in terms of Kolmogorov probability spaces. Since the axioms of mathematical probability theory say nothing about the conceptual meaning of “randomness” one considers probability as property of the generating conditions of a process so that one can relate randomness with predictability (or retrodictability). In the (...) measure-theoretical codification of stochastic processes genuine chance processes can be defined rigorously as so-called regular processes which do not allow a long-term prediction. We stress that stochastic processes are equivalence classes of individual point functions so that they do not refer to individual processes but only to an ensemble of statistically equivalent individual processes. Less popular but conceptually more important than statistical descriptions are individual descriptions which refer to individual chaotic processes. First, we review the individual description based on the generalized harmonic analysis by Norbert Wiener. It allows the definition of individual purely chaotic processes which can be interpreted as trajectories of regular statistical stochastic processes. Another individual description refers to algorithmic procedures which connect the intrinsic randomness of a finite sequence with the complexity of the shortest program necessary to produce the sequence. Finally, we ask why there can be laws of chance. We argue that random events fulfill the laws of chance if and only if they can be reduced to (possibly hidden) deterministic events. This mathematical result may elucidate the fact that not all nonpredictable events can be grasped by the methods of mathematical probability theory. (shrink)

There are two main ways to teach a course online: synchronously or asynchronously. In an asynchronous course, students can log on at their convenience and do the course work. In a synchronous course, there is a requirement that all students be online at specific times, to allow for a shared course environment. In this article, the author discusses the strengths and weaknesses of synchronous online learning for the teaching of undergraduate philosophy courses. The author discusses specific strategies and technologies he (...) uses in the teaching of online philosophy courses. In particular, the author discusses how he uses videoconferencing to create a classroom-like environment in an online class. (shrink)