Abstract
The main objective of this paper is to design a common background for various philosophical discussions about adequate conceptual analysis of “computation”.
I am indebted to Liesbeth de Mol and Giuseppe Primiero for inviting me to the Special Session in History and Philosophy of Computing at CiE 2018. I am also grateful to Patrick Blackburn (Roskilde) and Nina Gierasimczuk (KTH) for helpful comments on an earlier version of this paper. I am finally indebted to the anonymous reviewer for the valuable insight into possible new openings to which the subject matter of the paper can, and certainly will, lead.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
It might be claimed that humans always associate some meaning with symbols.
- 2.
The name “Nominalist Platonism” has been used in a different context by George Boolos in “Nominalist Platonism”, Philosophical Review 94(3): 327–344 (1985). I do not want to get into comparison here.
- 3.
John Searle (1980), “Minds, Brains and Programs”, Behavioral and Brain Sciences, 3(3): 417–457.
References
Benacerraf, P.: What numbers could not be. Philos. Rev. 74(1), 47–73 (1965)
Benacerraf, P.: Mathematical truth. J. Philos. 70(19), 661–679 (1973)
Benacerraf, P.: Recantation, or: any old \(\omega \)-sequence would do after all. Philosophia Math. 4, 184–189 (1996)
Boolos, G., Burgess, J., Jeffrey, R.: Computability and Logic. Cambridge University Press, Cambridge (2007)
Button, T., Smith, P.: The philosophical significance of Tennenbaum’s theorem. Philosophia Math. 20(1), 114–121 (2012)
Carnap, R.: Foundations of Logic and Mathematics. The University of Chicago Press, Chicago (1939)
Clarke-Doane, J.: What is the Benacerraf problem? In: Pataut, F. (ed.) Truth, Objects, Infinity: New Perspectives on the Philosophy of Paul Benacerraf. LEUS, vol. 28, pp. 17–43. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-45980-6_2
Copeland, J., Proudfoot, D.: Deviant encodings and Turing’s analysis of computability. Stud. Hist. Philos. Sci. 41, 247–252 (2010)
Dean, W.: Models and computability. Philosophia Math. 22(2), 143–166 (2013)
Goodman, N., Quine, W.V.: Steps toward a constructive nominalism. J. Symb. Log. 12(4), 105–122 (1947)
Halbach, V., Horsten, L.: Computational structuralism. Philosophia Math. 13(2), 174–186 (2005)
van Heuveln, B.: Emergence and consciousness. Ph.D. thesis, Binghamton University (2000)
Piccinini, G.: Physical Computation: A Mechanistic Account. Oxford University Press, Oxford (2015)
Quinon, P., Zdanowski, K.: Intended model of arithmetic. Argument from Tennenbaum’s theorem. In: Cooper, S., Loewe, B., Sorbi, A. (eds.) Computation and Logic in the Real World, CiE Proceedings (2007)
Rescorla, M.: Church’s thesis and the conceptual analysis of computability. Notre Dame J. Form. Log. 48, 253–280 (2007)
Shapiro, S.: Acceptable notation. Notre Dame J. Form. Log. 23(1), 14–20 (1982)
Tarski, A.: The concept of truth in formalized languages. In: Tarski, A. (ed.) Logic, Semantics, Metamathematics, pp. 152–278. Oxford Univeraity Press, Oxford (1936)
Turing, A.: On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. 42(1), 230–265 (1936)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Quinon, P. (2018). A Taxonomy of Deviant Encodings. In: Manea, F., Miller, R., Nowotka, D. (eds) Sailing Routes in the World of Computation. CiE 2018. Lecture Notes in Computer Science(), vol 10936. Springer, Cham. https://doi.org/10.1007/978-3-319-94418-0_34
Download citation
DOI: https://doi.org/10.1007/978-3-319-94418-0_34
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-94417-3
Online ISBN: 978-3-319-94418-0
eBook Packages: Computer ScienceComputer Science (R0)