Complexity

In Luciano Floridi (ed.), The Blackwell Guide to the Philosophy of Computing and Information. Oxford, UK: Blackwell. pp. 18–27 (2004)
  Copy   BIBTEX

Abstract

The prelims comprise: Introduction Time and Space in Computation Hierarchies and Reducibility NP‐completeness and Beyond Parallel Computation Complexity and Philosophy.

Categories

Add categories

Keywords

Reprint years

ISBN(s)

9780470757017   9780631229186

DOI

10.1002/9780470757017.ch2

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,931

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Universality, Invariance, and the Foundations of Computational Complexity in the light of the Quantum Computer.Michael Cuffaro - 2018 - In Hansson Sven Ove (ed.), Technology and Mathematics: Philosophical and Historical Investigations. Cham, Switzerland: Springer Verlag. pp. 253-282.
Finite Model Theory and its Applications.Erich Grädel, Phokion Kolaitis, Libkin G., Marx Leonid, Spencer Maarten, Vardi Joel, Y. Moshe, Yde Venema & Scott Weinstein - 2007 - Springer.
Richard M. Karp. Reducibility among combinatorial problems. Complexity of computer computations, Proceedings of a Symposium on the Complexity of Computer Computations, held March 20-22, 1972, at the IBM Thomas J. Watson Center, Yorktown Heights, New York, edited by Raymond E. Miller and James W. Thatcher, Plenum Press, New York and London 1972, pp. 85–103. [REVIEW]Ronald V. Book - 1975 - Journal of Symbolic Logic 40 (4):618-619.
Tractability and the computational mind.Rineke Verbrugge & Jakub Szymanik - 2018 - In Mark Sprevak & Matteo Colombo (eds.), The Routledge Handbook of the Computational Mind. Routledge. pp. 339-353.
Introduction to Circuit Complexity: A Uniform Approach.Heribert Vollmer - 1999 - Springer Verlag.
Computation and automata.Arto Salomaa - 1985 - New York: Cambridge University Press.
Quantum algorithms: Philosophical lessons.Amit Hagar - 2007 - Minds and Machines 17 (2):233-247.
Complexity and postmodernism: understanding complex systems.Paul Cilliers - 1998 - New York: Routledge.
From complexity to systems.Hrvoj Vančik - 2022 - Foundations of Chemistry 25 (3):345-358.
Computational complexity in the philosophy of mind: unconventional methods to solve the problem of logical omniscience.Safal Aryal - manuscript
Combinatorics, Computability and Logic: Proceedings of the Third International Conference on Combinatorics, Computability and Logic, (DMTCS’01).C. S. Calude - 2001 - Springer.
Logic and Complexity.Richard Lassaigne & Michel de Rougemont - 2012 - Springer Verlag.
Computational Complexity Theory and the Philosophy of Mathematics†.Walter Dean - 2019 - Philosophia Mathematica 27 (3):381-439.
Some decision problems of enormous complexity.Harvey Friedman - manuscript
Complexity and Postmodernism: Understanding Complex Systems.Paul Cilliers - 1998 - New York: Routledge.

Analytics

Added to PP
2023-06-15

Downloads
6 (#1,482,519)

6 months
3 (#1,044,897)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Alasdair Urquhart
University of Toronto, St. George Campus

Citations of this work

Ethics, speculation, and values.Rebecca Roache - 2008 - NanoEthics 2 (3):317-327.

Add more citations

References found in this work

No references found.

Add more references