# Why Philosophers Should Care About Computational Complexity

@article{Aaronson2011WhyPS, title={Why Philosophers Should Care About Computational Complexity}, author={Scott Aaronson}, journal={ArXiv}, year={2011}, volume={abs/1108.1791} }

One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance. In this essay, I offer a detailed case that one would be wrong. In particular, I argue that computational complexity theory---the field that studies the resources (such as time, space, and randomness) needed to solve computational problems---leads to new perspectives on the nature of mathematical knowledge, the strong AI debate…

## 107 Citations

### Is Complexity Important for Philosophy of Mind?

- PhilosophyArXiv
- 2021

It is argued that the simpler arguments along those lines do little to clarify the concept of mind, and the notions of computational complexity, and its generalization – metaphysical complexity – can be rediscovered in the mind and, surprisingly, in society.

### What Is a Computational Constraint

- Biology
- 2016

It is argued that a computational constraint is one that appeals to control of computational resources in a computationalist explanation, and some supposedly noncomputational or cognitivist constraints may be computational.

### Counterfactual Analysis by Algorithmic Complexity: A metric between possible worlds

- PhilosophyManuscrito
- 2022

A new form of analysis for counterfactuals: analysis by algorithmic complexity inspired by Lewis-Stalnaker's Possible Worlds Semantics is proposed, which allows for a new interpretation of the debate between David Lewis and Robert Stalnakers regarding the Limit and Singularity assumptions.

### A Turing test for free will

- PhilosophyPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
- 2012

A ‘Turing test’ for free will is proposed: a decision-maker who passes this test will tend to believe that he, she, or it possesses free will, whether the world is deterministic or not.

### The Accidental Philosopher and One of the Hardest Problems in the World

- PhilosophyPhilosophies
- 2022

Given the difficulties of defining “machine” and “think”, Turing proposed to replace the question “Can machines think?” with a proxy: how well can an agent engage in sustained conversation with a…

### Strict Finitism’s Unrequited Love for Computational Complexity

- Philosophy
- 2021

As a philosophy of mathematics, strict finitism has been traditionally concerned with the notion of feasibility, defended mostly by appealing to the physicality of mathematical practice. This has led…

### What can we know about that which we cannot even imagine?

- PhilosophyArXiv
- 2022

In this essay I will consider a sequence of questions, ending with one about the breadth and depth of the epistemic limitations of our our science and mathematics. I will then suggest a possible way…

### The Philosophy of Quantum Computing

- Philosophy
- 2021

From the philosopher’s perspective, the interest in quantum computation stems primarily from the way that it combines fundamental concepts from two distinct sciences: physics (especially quantum…

### Noisy Deductive Reasoning: How Humans Construct Math, and How Math Constructs Universes

- Mathematics, PhilosophyUndecidability, Uncomputability, and Unpredictability
- 2021

By embracing a model of mathematics as not perfectly predictable, this work generates a new and fruitful perspective on the epistemology and practice of mathematics.

### A Turing Program for Linguistic Theory

- LinguisticsBiolinguistics
- 2012

The great challenge for the TPLT is to precisify (formalize) the definitions of linguistic primitives in order that ‘linking hypotheses’ (not mere correlations) to as yet undiscovered neurobiological primitives can be formed.

## References

SHOWING 1-10 OF 146 REFERENCES

### P, NP and mathematics a computational complexity perspective

- Mathematics
- 2006

This paper shall try to explain why the P vs. NP problem, and others in computational complexity, are not only mathematical problems but also problems about mathematics, faced by the working mathematician.

### Knowledge, Understanding, and Computational Complexity

- Computer Science
- 1997

Searle’s arguments that intelligence cannot arise from formal programs are refuted by arguing that his analogies and thought-experiments are fundamentally flawed: he imagines a world in which…

### What is thought?

- Philosophy
- 2003

In What Is Thought? Eric Baum proposes a computational explanation of thought. Just as Erwin Schrodinger in his classic 1944 work What Is Life? argued ten years before the discovery of DNA that life…

### The Nature of Computation

- Computer Science, Art
- 2011

The authors explain why the P vs. NP problem is so fundamental, and why it is so hard to resolve, and lead the reader through the complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and the outer reaches of quantum computing.

### Knowledge, Creativity and P versus NP

- Computer Science
- 2009

The P versus NP question of computer science is explained, and the consequences of its possible resolution, P = NP or P 6= NP, are explained, to the power and security of computing, the human quest for knowledge, and beyond.

### Non-Turing Computers and Non-Turing Computability

- Computer SciencePSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association
- 1994

These new computers serve to show that Church's thesis is a thoroughly contingent claim, and since these new computers share the fundamental properties of a TM in ordinary operation, a computability theory based on these non-Turing computers is no less worthy of investigation than orthodox computation theory.

### Classifying the computational complexity of problems

- Computer ScienceThe Journal of Symbolic Logic
- 1987

A branch of computational complexity theory is described which attempts to expose more structure within the decidable side of the boundary by placing upper bounds on the amounts of computational resources which are needed to solve the problem.

### The Turing Test as Interactive Proof

- Philosophy
- 2007

It is argued that the Gordian knot between the two opposing views of the sufficiency of the Turing Test can be cut, so long as a very slight weakening of the criterion is allowed from one of logical proof to one of statistical proof under weak realizability assumptions.

### Reasoning about knowledge

- Computer Science
- 1995

Reasoning About Knowledge is the first book to provide a general discussion of approaches to reasoning about knowledge and its applications to distributed systems, artificial intelligence, and game theory.