pw201 + turing   5

Why Philosophers Should Care About Computational Complexity
"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, computationalism, the problem of logical omniscience, Hume's problem of induction, Goodman's grue riddle, the foundations of quantum mechanics, economic rationality, closed timelike curves, and several other topics of philosophical interest. I end by discussing aspects of complexity theory itself that could benefit from philosophical analysis."
philosophy  programming  complexity  compsci  turing 
september 2011 by pw201
Unequally Yoked: Guestblogging Challenge: Take the Ideological Turing Test!
A suggestion: if you want to show that you understand the other side's position, test whether you can be distinguished from a genuine advocate of that position in a suitably anonymous test.
philosophy  debate  turing 
july 2011 by pw201
A Turing Machine Overview
Someone has built this excellent mechanical Turing machine (OK, so it has electronics in the read/write head, but it's got real tape).
computers  hardware  programming  software  turing  video  algorithm  history  logic  compsci 
march 2010 by pw201
Oracle
Greg Egan short where fictionalised Alan Turing meets C.S. Lewis
egan  lewis  turing  ai  physics  sci-fi  sf 
february 2007 by pw201

Copy this bookmark:



description:


tags: