Skip to main content
SpringerLink
Log in
Book cover

Conference on Computability in Europe

CiE 2018: Sailing Routes in the World of Computation pp 338–348Cite as

A Taxonomy of Deviant Encodings

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10936))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    It might be claimed that humans always associate some meaning with symbols.

  2. 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. 3.

    John Searle (1980), “Minds, Brains and Programs”, Behavioral and Brain Sciences, 3(3): 417–457.

References

  1. Benacerraf, P.: What numbers could not be. Philos. Rev. 74(1), 47–73 (1965)

    Article  MathSciNet  Google Scholar 

  2. Benacerraf, P.: Mathematical truth. J. Philos. 70(19), 661–679 (1973)

    Article  MathSciNet  Google Scholar 

  3. Benacerraf, P.: Recantation, or: any old \(\omega \)-sequence would do after all. Philosophia Math. 4, 184–189 (1996)

    Article  MathSciNet  Google Scholar 

  4. Boolos, G., Burgess, J., Jeffrey, R.: Computability and Logic. Cambridge University Press, Cambridge (2007)

    Book  Google Scholar 

  5. Button, T., Smith, P.: The philosophical significance of Tennenbaum’s theorem. Philosophia Math. 20(1), 114–121 (2012)

    Article  MathSciNet  Google Scholar 

  6. Carnap, R.: Foundations of Logic and Mathematics. The University of Chicago Press, Chicago (1939)

    MATH  Google Scholar 

  7. 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

    Chapter  Google Scholar 

  8. Copeland, J., Proudfoot, D.: Deviant encodings and Turing’s analysis of computability. Stud. Hist. Philos. Sci. 41, 247–252 (2010)

    Article  Google Scholar 

  9. Dean, W.: Models and computability. Philosophia Math. 22(2), 143–166 (2013)

    Article  MathSciNet  Google Scholar 

  10. Goodman, N., Quine, W.V.: Steps toward a constructive nominalism. J. Symb. Log. 12(4), 105–122 (1947)

    Article  MathSciNet  Google Scholar 

  11. Halbach, V., Horsten, L.: Computational structuralism. Philosophia Math. 13(2), 174–186 (2005)

    Article  MathSciNet  Google Scholar 

  12. van Heuveln, B.: Emergence and consciousness. Ph.D. thesis, Binghamton University (2000)

    Google Scholar 

  13. Piccinini, G.: Physical Computation: A Mechanistic Account. Oxford University Press, Oxford (2015)

    Book  Google Scholar 

  14. 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)

    Google Scholar 

  15. Rescorla, M.: Church’s thesis and the conceptual analysis of computability. Notre Dame J. Form. Log. 48, 253–280 (2007)

    Article  MathSciNet  Google Scholar 

  16. Shapiro, S.: Acceptable notation. Notre Dame J. Form. Log. 23(1), 14–20 (1982)

    Article  MathSciNet  Google Scholar 

  17. Tarski, A.: The concept of truth in formalized languages. In: Tarski, A. (ed.) Logic, Semantics, Metamathematics, pp. 152–278. Oxford Univeraity Press, Oxford (1936)

    Google Scholar 

  18. Turing, A.: On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. 42(1), 230–265 (1936)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Philosophy Department, Lund University, Lund, Sweden

    Paula Quinon

Authors
  1. Paula Quinon
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Paula Quinon .

Editor information

Editors and Affiliations

  1. Kiel University, Kiel, Germany

    Florin Manea

  2. Queens College, CUNY, Queens, New York, USA

    Russell G. Miller

  3. Kiel University, Kiel, Germany

    Dirk Nowotka

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

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)

Publish with us

Policies and ethics

Search

Navigation