Church's Thesis and the Conceptual Analysis of Computability

No abstract is available for this paper.

• Publication year

  2007

• Venue

  Notre Dame J. Formal Log.

• Publication date

  2007-04-20

• Fields of study

  Philosophy, Computer Science

• Identifiers
  DOI 10.1305/ndjfl/1179323267
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• What Can We Do?

  2020cited by this paper
• What Is Mathematical Intuition

  2006influential reference
• On the Church-Turing thesis

  2006cited by this paper
• Godel, Turing

  2006influential reference
• The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions

  2004cited by this paper
• Calculations by Man and Machine: Conceptual Analysis

  2000cited by this paper
• What Can We Do “In Principle”?

  1997influential reference
• Computability and Recursion

  1996influential reference
• K-graph machines : generalizing Turing's machines and arguments

  1996cited by this paper
• The Universal Turing Machine: A Half-Century Survey

  1992cited by this paper
• Mechanical Procedures and Mathematical Experience

  1991influential reference
• The confluence of ideas in 1936

  1988cited by this paper
• Turing's analysis of computability, and major applications of it

  1988cited by this paper
• Computability and logic (2. ed.)

  1987influential reference
• Recursively enumerable sets and degrees

  1987cited by this paper
• Acceptable notation

  1982influential reference
• Church's Thesis and Principles for Mechanisms

  1980cited by this paper
• An introduction to the general theory of algorithms

  1978cited by this paper
• THE LANGUAGE OF THOUGHT

  1977influential reference
• Some metamathematical results on completeness and consistency, on formally undecidable propositions of principia mathematica and related systems i, and on completeness and consistency KURT GÖDEL (1930b, 1931, and 1931a)

  1970cited by this paper
• Theory of Recursive Functions and Effective Computability.

  1969cited by this paper
• Theory of Recursive Functions and Effective Computability

  1969cited by this paper
• ON FORMALLY UNDECIDABLE PROPOSITIONS OF PRINCIPIA MATHEMATICA AND RELATED SYSTEMS

  1963cited by this paper
• Word and Object

  1960cited by this paper
• The collected works

  1939cited by this paper
• On Computable Numbers, with an Application to the Entscheidungsproblem.

  1937influential reference
• On undecidable propositions of formal mathematical systems

  1934cited by this paper

• Intensional Differences Between Programming Languages: A Conceptual and Practical Analysis

  2025cites this paper
• Degree Spectra, and Relative Acceptability of Notations

  2023cites this paper
• On Algorithms, Effective Procedures, and Their Definitions

  2023cites this paper
• Relatively acceptable notation

  2022cites this paper
• Computability, Notation, and de re Knowledge of Numbers

  2022cites this paper
• On Two Different Kinds of Computational Indeterminacy *

  2021cites this paper
• Mathematical counterfactuals with number-theoretic antecedents and extra-mathematical explanation

  2021cites this paper
• The dependence of computability on numerical notations

  2020cites this paper
• What is the Church-Turing Thesis?

  2020cites this paper
• Implicit and Explicit Examples of the Phenomenon of Deviant Encodings

  2020cites this paper
• THE UNDERDETERMINATION OF THE CHURCH-TURING THEOREM

  2019cites this paper
• Syntax, Semantics, and Computer Programs

  2019cites this paper
• Representations of Natural Numbers and Computability of Various Functions

  2019cites this paper
• Can Church’s thesis be viewed as a Carnapian explication?

  2019cites this paper
• A DECISION PROCEDURE FOR PURE FIRST-ORDER LOGIC

  2019cites this paper
• Counterpossibles in Science: The Case of Relative Computability

  2018cites this paper
• Sailing Routes in the World of Computation

  2018cites this paper
• A Taxonomy of Deviant Encodings

  2018cites this paper
• ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS

  2018cites this paper
• On the Relation of Computing to the World

  2017influential citation
• Taming the impossible

  2017cites this paper
• Turing, Gödel and the “Bright Abyss”

  2017cites this paper
• Computing with Numbers and Other Non-syntactic Things: De re Knowledge of Abstract Objects

  2017cites this paper
• Explication, Open-Texture, and Church’s Thesis

  2016cites this paper
• The Representational Foundations of Computation

  2015influential citation
• Against Structuralist Theories of Computational Implementation

  2013cites this paper
• Copeland and Proudfoot on computability

  2012cites this paper
• The Physical Church–Turing Thesis: Modest or Bold?

  2011cites this paper
• Contextually Defining ‘ Gnomic ’ and Thoughts on Adjective Algorithms

  2011cites this paper
• Deviant encodings and Turing’s analysis of computability

  2010cites this paper
• The influence of domain interpretations on computational models

  2009influential citation
• A Natural Axiomatization of Computability and Proof of Church's Thesis

  2008cites this paper
• The Church-Turing Thesis over Arbitrary Domains

  2008influential citation
• A Natural Axiomatization of Church's Thesis

  2007cites this paper
• Philosophy of Computer Science: An Introductory Course

  2005cites this paper
• Contributed Talk Abstracts

  year unknowninfluential citation