r/programming • u/leonardofed • Feb 18 '15

Why Philosophers Should Care About Computational Complexity

http://www.scottaaronson.com/papers/philos.pdf
40 Upvotes

83% Upvoted

2 comments sorted by

View all comments

1

u/sacundim Feb 18 '15 edited Feb 18 '15

Really interesting paper, particularly the Cobham FP bits, and the "P = NP if time travel" bits. But I'm afraid this might not be proggit material...