News for hackers. Stuff that matters.
Re:Can programming be liberated from the von Neumann style? ... by TomSwirly on Saturday June 19, 2021 @09:57AM (#27560486)
General recursive function, you mean.

The point is that creating hardware that executes a Turing machine or something like it is easy, but constructing hardware that executes a general recursive function is so hard that it has never been done.

Re:Can programming be liberated from the von Neumann style? ... by kaba0 on Saturday June 19, 2021 @11:15AM (#27561177)
My point was that a random mathematical expression will not be constructive in itself. And you are right, that either general recursive functions or lambda expressions are required to be equivalent to Turing machines. And while I agree that recursive functions are hard to execute on hardware - but certain aspects of it are apparent in CPU design — out-of-order execution is sort of lambda-like.