The Question of the Boundaries of Computer Science

Janusz Mączka; Adam Olszewski

doi:10.21852/sem.2020.4.04

Published: 2022-09-20

Vol. 41 No. 4 (2020)

The Question of the Boundaries of Computer Science

Janusz Mączka

, Adam Olszewski

Seminare. Learned Investigations

Section: Philosophy

https://doi.org/10.21852/sem.2020.4.04

Abstract

A thesis defining the boundaries of computer science is first formulated in relation to a certain work of Stuart Shapiro. It is argued that these boundaries are determined by the properties of the mind in the real world. It is the Church thesis that determines and specifies these boundaries. Next, some issues concerning the understanding of the Church thesis will be considered such as the division of its formulations and versions. Finally, the relations among the classes of the recursive functions, algorithms, machines and computer programs will be discussed as the main theme of the article. Comments will also be made in the text on the understanding of the term ‘effectively’.

Keywords:

boundaries, computer science, Church’s thesis, effectively, machines, mind

Download files

PDF

Citation rules

Mączka, J., & Olszewski , A. (2022). The Question of the Boundaries of Computer Science. Seminare. Learned Investigations, 41(4), 45–57. https://doi.org/10.21852/sem.2020.4.04

Cited by / Share

References

Böhm, C., Jacopini, G., (1966). Flow diagrams, Turing machines and languages with only two formation rules. Communications of the Association for Computing Machinery, 9, 366—371.
Google Scholar

Burgin, M. (2005). Super-Recursive Algorithms. Springer.
Google Scholar

Cutland, N. (1980). Computability, Cambridge University Press.
Google Scholar

Eden, A. H. Three Paradigms of Computer Science. pp.1—30, preprint. (Three Paradigms of Computer Science Minds and Machines volume 17(2007), pages 135–167).
Google Scholar

Harel, D. (2000). Rzecz o istocie informatyki. WNT; English original: Algorithmics. The Spirit of Computing, 1987.
Google Scholar

Kielkopf, Ch. F. (1978). The intentionality of the predicate ‘__is recursive’. Notre Dame Journal of Formal Logic, 19, 165—173.
Google Scholar

Odifreddi, P. (1989). Classical Recursion Theory. North-Holland.
Google Scholar

Adam Olszewski, Teza Churcha. Kontekst historyczno-filozoficzny; (“Church's Thesis. Historical and Philosophical Context”), Universitas 2009.
Google Scholar

Parsons, Ch. (2008). Mathematical Thought and Its Objects, CUP.
Google Scholar

Shapiro, S. C. (2014) Computer Science: The Study of Procedures, http://www.cse.buffalo.edu.
Google Scholar

Wang, H. (1957). A variant of Turing ‘s theory of calculating machines. JACM (Journal of the Association for Computing Machinery). 4, 63—92.
Google Scholar

Webster’s Third New International Dictionary, unabridged (1993).
Google Scholar