3 ms·
Not at the moment. but there was a time that some thought that we should be able to produce a general purpose programming language, to solve every problem. One
by frankreyes 3y ago
Not at the moment. but there was a time that some thought that we should be able to produce a general purpose programming language, to solve every problem. One size fits all.
It took more than 40 years to realize that was never going to be.
There's a joke about that in commit strip:
https://www.commitstrip.com/en/2016/08/25/a-very-comprehensive-and-precise-spec/ https://www.commitstrip.com/en/2016/08/25/a-very-comprehensi...
- tialaramex 3y agoYour claim doesn't make any sense. The stored program electronic computers are a realisation of the concept from Turing, but Turing's work is based on Kurt Gödel's work, and the whole point of what Gödel showed was that no, you can't do that. There's a period of maybe a couple of decades at the start of the 20th century where Whitehead and Russell have used logic to prove that 1 + 1 = 2, and it seems like maybe all of mathematics can be placed on a firm foundation, and then Gödel shows that oops, no, actually a logical system can't prove some true things, or, it can contradict itself. No firm foundations for us.
- frankreyes 3y agoOh yes the the incompleteness theorem. Sorry. I meant to say "one single ruling programming language to solve every Turing programming problem". For example Java will be the ultimate ruling programming language, having a CPU that would directly run java byte code. Nope.