Philosophy of computer science

The philosophy of computer science is concerned with the philosophical questions that arise within the study of computer science. There is still no common understanding of the content, aim, focus, or topic of the philosophy of computer science,^[1] despite some attempts to develop a philosophy of computer science like the philosophy of physics or the philosophy of mathematics. Due to the abstract nature of computer programs and the technological ambitions of computer science, many of the conceptual questions of the philosophy of computer science are also comparable to the philosophy of science, philosophy of mathematics, and the philosophy of technology.^[2]

Overview

Many of the central philosophical questions of computer science are centered on the logical, ontological and epistemological issues that concern it.^[3] Some of these questions may include:

What is computation?
Does the Church–Turing thesis capture the mathematical notion of an effective method in logic and mathematics?^[4]^[5]
What are the philosophical consequences of the P vs NP problem?
What is information?

Church–Turing thesis

The Church–Turing thesis and its variations are central to the theory of computation. Since, as an informal notion, the concept of effective calculability does not have a formal definition, the thesis, although it has near-universal acceptance, cannot be formally proven. The implications of this thesis is also of philosophical concern. Philosophers have interpreted the Church–Turing thesis as having implications for the philosophy of mind.^[6]^[7]

P versus NP problem

The P versus NP problem is an unsolved problem in computer science and mathematics. It asks whether every problem whose solution can be verified in polynomial time (and so defined to belong to the class NP) can also be solved in polynomial time (and so defined to belong to the class P). Most computer scientists believe that P ≠ NP.^[8]^[9] Apart from the reason that after decades of studying these problems no one has been able to find a polynomial-time algorithm for any of more than 3000 important known NP-complete problems, philosophical reasons that concern its implications may have motivated this belief.

For instance, according to Scott Aaronson, the American computer scientist then at MIT:

If P = NP, then the world would be a profoundly different place than we usually assume it to be. There would be no special value in "creative leaps", no fundamental gap between solving a problem and recognizing the solution once it's found. Everyone who could appreciate a symphony would be Mozart; everyone who could follow a step-by-step argument would be Gauss.^[10]

References

↑ Tedre, Matti (2014). The Science of Computing: Shaping a Discipline. Chapman Hall.
↑ Turner, Raymond; Angius, Nicola (2020), Zalta, Edward N., ed., The Philosophy of Computer Science (Spring 2020 ed.), Metaphysics Research Lab, Stanford University, https://plato.stanford.edu/archives/spr2020/entries/computer-science/, retrieved 2020-05-21
↑ Turner, Raymond (January 2008). "The Philosophy of Computer Science". Journal of Applied Logic 6 (4): 459. doi:10.1016/j.jal.2008.09.006. https://www.researchgate.net/publication/306292584.
↑ Copeland, B. Jack. "The Church-Turing Thesis". Stanford Encyclopedia of Philosophy. https://plato.stanford.edu/archives/fall2008/entries/church-turing/.
↑ Hodges, Andrew. "Did Church and Turing have a thesis about machines?". https://www.turing.org.uk/publications/sciam.html.
↑ Copeland, B. Jack (November 10, 2017). "The Church-Turing Thesis". in Zalta, Edward N.. Stanford Encyclopedia of Philosophy. https://plato.stanford.edu/entries/church-turing/.
↑ For a good place to encounter original papers see Chalmers, David J., ed (2002). Philosophy of Mind: Classical and Contemporary Readings. New York: Oxford University Press. ISBN 978-0-19-514581-6. OCLC 610918145.
↑ William I. Gasarch (June 2002). "The P=?NP poll.". SIGACT News 33 (2): 34–47. doi:10.1145/564585.564599. http://www.cs.umd.edu/~gasarch/papers/poll.pdf. Retrieved 26 September 2018.
↑ Rosenberger, Jack (May 2012). "P vs. NP poll results". Communications of the ACM 55 (5): 10. http://mags.acm.org/communications/201205?pg=12.
↑ "Shtetl-Optimized » Blog Archive » Reasons to believe" (in en-US). https://www.scottaaronson.com/blog/?p=122.

External links

0.00

(0 votes)

[Tedre2014-1] Tedre, Matti (2014). The Science of Computing: Shaping a Discipline. Chapman Hall.

[2] Turner, Raymond; Angius, Nicola (2020), Zalta, Edward N., ed., The Philosophy of Computer Science (Spring 2020 ed.), Metaphysics Research Lab, Stanford University, https://plato.stanford.edu/archives/spr2020/entries/computer-science/, retrieved 2020-05-21

[3] Turner, Raymond (January 2008). "The Philosophy of Computer Science". Journal of Applied Logic 6 (4): 459. doi:10.1016/j.jal.2008.09.006. https://www.researchgate.net/publication/306292584.

[4] Copeland, B. Jack. "The Church-Turing Thesis". Stanford Encyclopedia of Philosophy. https://plato.stanford.edu/archives/fall2008/entries/church-turing/.

[5] Hodges, Andrew. "Did Church and Turing have a thesis about machines?". https://www.turing.org.uk/publications/sciam.html.

[6] Copeland, B. Jack (November 10, 2017). "The Church-Turing Thesis". in Zalta, Edward N.. Stanford Encyclopedia of Philosophy. https://plato.stanford.edu/entries/church-turing/.

[7] For a good place to encounter original papers see Chalmers, David J., ed (2002). Philosophy of Mind: Classical and Contemporary Readings. New York: Oxford University Press. ISBN 978-0-19-514581-6. OCLC 610918145.

[poll-8] William I. Gasarch (June 2002). "The P=?NP poll.". SIGACT News 33 (2): 34–47. doi:10.1145/564585.564599. http://www.cs.umd.edu/~gasarch/papers/poll.pdf. Retrieved 26 September 2018.

[9] Rosenberger, Jack (May 2012). "P vs. NP poll results". Communications of the ACM 55 (5): 10. http://mags.acm.org/communications/201205?pg=12.

[10] "Shtetl-Optimized » Blog Archive » Reasons to believe" (in en-US). https://www.scottaaronson.com/blog/?p=122.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

v t e Computer science
Note: This template roughly follows the 2012 ACM Computing Classification System.
Hardware	Printed circuit board Peripheral Integrated circuit Very Large Scale Integration Systems on Chip (SoCs) Energy consumption (Green computing) Electronic design automation Hardware acceleration
Computer systems organization	Computer architecture Embedded system Real-time computing Dependability
Networks	Network architecture Network protocol Network components Network scheduler Network performance evaluation Network service
Software organization	Interpreter Middleware Virtual machine Operating system Software quality
Software notations and tools	Programming paradigm Programming language Compiler Domain-specific language Modeling language Software framework Integrated development environment Software configuration management Software library Software repository
Software development	Software development process Requirements analysis Software design Software construction Software deployment Software maintenance Programming team Open-source model
Theory of computation	Model of computation Formal language Automata theory Computational complexity theory Logic Semantics
Algorithms	Algorithm design Analysis of algorithms Algorithmic efficiency Randomized algorithm Computational geometry
Mathematics of computing	Discrete mathematics Probability Statistics Mathematical software Information theory Mathematical analysis Numerical analysis
Information systems	Database management system Information storage systems Enterprise information system Social information systems Geographic information system Decision support system Process control system Multimedia information system Data mining Digital library Computing platform Digital marketing World Wide Web Information retrieval
Security	Cryptography Formal methods Security services Intrusion detection system Hardware security Network security Information security Application security
Human–computer interaction	Interaction design Social computing Ubiquitous computing Visualization Accessibility
Concurrency	Concurrent computing Parallel computing Distributed computing Multithreading Multiprocessing
Artificial intelligence	Natural language processing Knowledge representation and reasoning Computer vision Automated planning and scheduling Search methodology Control method Philosophy of artificial intelligence Distributed artificial intelligence
Machine learning	Supervised learning Unsupervised learning Reinforcement learning Multi-task learning Cross-validation
Graphics	Animation Rendering Image manipulation Graphics processing unit Mixed reality Virtual reality Image compression Solid modeling
Applied computing	E-commerce Enterprise software Computational mathematics Computational physics Computational chemistry Computational biology Computational social science Computational engineering Computational healthcare Digital art Electronic publishing Cyberwarfare Electronic voting Video games Word processing Operations research Educational technology Document management
Book Category Outline WikiProject Commons

Philosophy of computer science

Contents

Overview

Church–Turing thesis

P versus NP problem

See also

References

Further reading

External links