Open Access

Implicit and Explicit Examples of the Phenomenon of Deviant Encodings

   | Nov 04, 2020


[1] Button, T. & Smith, P. (2012). The Philosophical Significance of Tennenbaum’s Theorem. Philosophia Mathematica 20(1): 114–121.Search in Google Scholar

[2] Carnap, R. (1950). Logical Foundations of Probability. Routledge and Kegan Paul.Search in Google Scholar

[3] Copeland, J. & Proudfoot, D. (2010). Deviant encodings and Turing’s analysis of computability. Studies in History and Philosophy of Science 41: 247–252.Search in Google Scholar

[4] Cuneo T. & Shafer-Landau R. (2014). The moral fixed points: new directions for moral nonnaturalism. Philosophical Studies 171: 399-443.Search in Google Scholar

[5] Dean, W. (2014). Models and Computability. Philosophia Mathematica 22 (2): 143–166.Search in Google Scholar

[6] Eklund, M. (2015). Intuitions, Conceptual Engineering, and Conceptual Fixed Points. In: Daly C. (Ed.). The Palgrave Handbook of Philosophical Methods. Palgrave Macmillan: 363–385.Search in Google Scholar

[7] Gandy, R. (1980). Church’s Thesis and Principles for Mechanisms. In: Barwise, J., Keisler H. J. & Kunen, K. (Eds.). The Kleene Symposium. North-Holland Publishing Company: 123–148.Search in Google Scholar

[8] Gödel, K. (193?). Undecidable Diophantine Propositions. In: Feferman S., et al. (Eds.). Gödel, K., Collected Works, Volume III, Unpublished essays and lectures. Oxford University Press 1995: 164–175.Search in Google Scholar

[9] Halbach, V. & Horsten, L. (2005). Computational Structuralism. Philosophia Mathematica 13(2): 174–186.Search in Google Scholar

[10] Kreisel, G.(1987). Church’s thesis and the ideal of informal rigour. Notre Dame Journal of Formal Logic 28: 499–519.Search in Google Scholar

[11] Makovec, D. & Shapiro S. (Eds.) (2019). Friedrich Waismann. The Open Texture of Analytic Philosophy. Springer.10.1007/978-3-030-25008-9Search in Google Scholar

[12] Piccinini, G. (2010/2017). Computation in Physical Systems. In: Zalta, E.N. (Ed.) The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University.Search in Google Scholar

[13] Piccinini, G. (2015). Physical Computation: A Mechanistic Account. Oxford University Press.10.1093/acprof:oso/9780199658855.001.0001Search in Google Scholar

[14] Putnam, H. (1980). Models and Reality. Journal of Symbolic Logic 45(3): 464–482.Search in Google Scholar

[15] Quinon, P. & Zdanowski, K. (2007). Intended Model of Arithmetic. Argument from Tennenbaum’s Theorem. In: Cooper, S. B., Kent, T. F., Löwe, B. & Sorbi, A. (Eds.). Computation and Logic in the Real World. CiE: 313–317.Search in Google Scholar

[16] Quinon, P. (2014). From Computability over Strings of Characters to Natural Numbers. In: Olszewski, A.; Brożek, B. & Urbańczyk, P. (Eds.). Church’s Thesis, Logic, Mind & Nature. Copernicus Center Press: 310–330.Search in Google Scholar

[17] Quinon, P. (2018). Taxonomy of Deviant Encodings, Lecture Notes in Computer Sciences 10963: 338–348.10.1007/978-3-319-94418-0_34Search in Google Scholar

[18] Quinon, P. (2019). Can Church’s Thesis be Viewed as a Carnapian Explication? Synthese: Online First.10.1007/s11229-019-02286-7Search in Google Scholar

[19] Quinon, P. (2020). The Anti-Mechanism Argument Based on Gödel’s Incompleteness Theorems, Indescribability of the Concept of Natural Number and Deviant Encodings. Semiotic Studies. In press.Search in Google Scholar

[20] Rescrola, M. (2007). Church’s thesis and the conceptual analysis of computability. Notre Dame Journal of Formal Logic 48 (2): 253–280.Search in Google Scholar

[21] Rescrola, M. (2012). Copeland and Proudfoot on computability. Studies in History and Philosophy of Science Part A 43 (1): 199–202.Search in Google Scholar

[22] Shagrir, O. (2006). Gödel on Turing on Computability. In: Olszewski, A.; Woleński, J. & Janusz, R. (Eds.), Church’s Thesis after 70 years. Ontos-Verlag: 393–419.Search in Google Scholar

[23] Shapiro, S. (1982). Acceptable Notation. Notre Dame Journal of Formal Logic 23(1): 14–20.Search in Google Scholar

[24] Sieg, W. (1997). Step by Recursive Step: Church’s Analysis of Effective Calculability. The Bulletin of Symbolic Logic 3 (2): 154-180.Search in Google Scholar

[25] Soare, R. (1996). Computability and Recursion. Bulletin of Symbolic Logic 2: 284–321.Search in Google Scholar

[26] Trakhtenbrot, B. (1988). Comparing the Church and Turing approaches: two prophetical messages. In: Herken, R. (Ed.) The universal Turing machine: a half-century survey. Oxford University Press: 603–630.Search in Google Scholar

[27] Turing, A. (1936). On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 42: 230–265; correction in (1937) 43: 544–546; reprinted in (Davis 1965: 115–154); page numbers refer to the (1965) edition.Search in Google Scholar

[28] van Heuveln, B. (2000). Emergence and consciousness: Explorations into the Philosophy of Mind via the Philosophy of Computation. Ph.D. thesis. State University of New York at Binghampton.Search in Google Scholar

Publication timeframe:
4 times per year
Journal Subjects:
Philosophy, other