A. Church

A. Clark

C. Ginet

C. McGinn

D.H. Mellor

E. Hutchins

E. Rosch

E. Zymach

H.L. Dreyfus

J. Haugeland

J.A. Fodor

J.R. Searle

Mark D. Sprevak

P. Maddy

R.G. Millikan

S.A. Kripke

Crossref

Kripke’s paradox and the Church–Turing thesis

Kripke (1982, Wittgenstein on rules and private language. Cambridge, MA: MIT Press) presents a rule-following paradox in terms of what we meant by our past use of “plus”, but the same paradox can be applied to any other term in natural language. Many responses to the paradox concentrate on fixing determinate meaning for “plus”, or for a small class of other natural language terms. This raises a problem: how can these particular responses be generalised to the whole of natural language? In this paper, I propose a solution. I argue that if natural language is computable in a sense defined below, and the Church–Turing thesis is accepted, then this auxiliary problem can be solved

Sprevak, Mark

Edinburgh Research Explorer

Kripke's paradox and the Church-Turing thesis

https://www.pure.ed.ac.uk/ws/files/8455288/Sprevak_2008_Kripke_s_paradox.pdf

Kripke's paradox and the Church-Turing thesis

Abstract

Similar works

Full text

Available Versions

Crossref

Edinburgh Research Explorer