| |||||||||||||
turing completeturing completePosted Dec 20, 2011 9:50 UTC (Tue) by HelloWorld (guest, #56129)In reply to: turing complete by tialaramex Parent article: Cracks in the Foundation (PHP Advent)
> So your main complaint now is that the untyped lambda calculus can't pretend to be a hardware random number generator?
No, it's not. But your response shows yet again that this discussion is utterly pointless. You don't want to get the point, fine with me. Have a nice life.
(Log in to post comments)
turing complete Posted Dec 20, 2011 10:39 UTC (Tue) by smurf (subscriber, #17840) [Link]
Please engage brain.
A PHP without external state is as powerful as a pure Lambda calculus. That's a fact.
PHP has features to talk to the external worls, save state, and whatnot, because it's designed to be (mostly) useful. A pure lambda calculus has not, because it's designed to prove computability theorems and related stuff.
From a mathematical PoV, that's rather superficial. You can write a Web server in COBOL or Intercal or even Brainfuck if you add the required features somehow, and you can write a Prolog theorem prover in them too.
Doesn't mean that doing any of this makes any practical sense whatsoever.
turing complete Posted Dec 22, 2011 3:18 UTC (Thu) by bronson (subscriber, #4806) [Link]
If you're going to concede, why not concede gracefully?
turing complete Posted Dec 22, 2011 5:32 UTC (Thu) by raven667 (subscriber, #5198) [Link]
Where's the fun in that? Go out guns blazing.
|
|||||||||||||