Why philosophers should care about complexity

Tractable Competence. Marcello Frixione - - Minds and Machines 11 3 Computational Explanation in Neuroscience. Gualtiero Piccinini - - Synthese 3 Computation and Automata. Arto Salomaa - - Cambridge University Press. Arthur W. Ko - - Mathematical Logic Quarterly 50 6 Computational Complexity and Godel's Incompleteness Theorem. Gregory J. Added to PP index Total views 85 , of 2,, Recent downloads 6 months 9 72, of 2,, How can I increase my downloads?

Sign in to use this feature. About us. Editorial team. No keywords specified fix it. Computational Complexity in Philosophy of Computing and Information categorize this paper.

Applied ethics. History of Western Philosophy. Normative ethics. Philosophy of biology. In particular I might like to have a further and deeper look at the discussion centering around machine learning and induction.

Thanks to my colleague for this interesting tip! May 29, Misha Y. Galef type : Theory 5: gives you a general concept or lens you can use to analyze many different things Values 1: makes an explicit argument about values Style 1: teaches principles of thinking directly Galef type : Theory 5: gives you a general concept or lens you can use to analyze many different things Values 1: makes an explicit argument about values Style 1: teaches principles of thinking directly There are no discussion topics on this book yet.

Be the first to start one ». Readers also enjoyed. Goodreads is hiring! If you like books and love to build cool products, we may be looking for you. Learn more ». About Scott Aaronson. Scott Aaronson. Books by Scott Aaronson. Some of the best stories take a few hundred years to tell. But if you're in the mood for uncanny connections, hoping back and forth through Read more Trivia About Why Philosophers No trivia or quizzes yet.

Add some now ». Welcome back. Some features of the site may not work correctly. DOI: Colloquium Comput. 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 theorythe field that studies the resources such as time, space, and randomness needed to solve computational problemsleads to new perspectives on the nature of mathematical knowledge, the strong AI debate… Expand. View PDF on arXiv. Save to Library Save. Create Alert Alert. Share This Paper. Background Citations. Methods Citations. Results Citations. Topics from this paper. Computational complexity theory Computational theory of mind Quantum mechanics Computation.

Artificial general intelligence Mathematical induction Computational problem Randomness. Rationality Computable function Hume programming language. Citation Type.