= 27d567bc2d48d9f40e9ccc20ea370b15)
Eugine_Nier comments on [Link] A superintelligent solution to the Fermi paradox - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (75)
Your link isn't a stupid person, but to some extent, the lack of interest in hypercomputation says what the field thinks of it. Compare it to quantum computation, where people were avidly researching it and coming up with algorithms decades before even toy quantum computers showed up in cutting-edge labs.
Wei Dai's link is pretty controversial.
My understanding of the history is that everyone believed the extended Church-Turing thesis until someone noticed that the (already established) theory of quantum mechanics contradicted it.
I don't think I've ever seen anyone invoke the extended Church-Turing thesis by either name or substance before quantum computing came around.
People were talking about P-time before quantum computing and implicitly assuming that it applied to any computer they could build.
I don't see how one would apply "P-time" to "any computer they could build".
I meant "apply" in the sense that one applies a mathematical model to a phenomenon. Specifically, it was implicitly assumed the the notion of polynomial time captured what was actually possible to compute in polynomial time.