How we got recursion.

in dlike •  6 years ago  (edited)

The topic might be slightly esoteric to some people, but what Brailsford describes is how the software industry finally settled on how the problem of "recursion" should be addressed in higher level programming languages.

Instead of tackling the problem from the perspective of general recursion, to deal with high level Ackermann functions, different languages went about it different ways.

One way is to implement fake recursion that doesn't keep track of each individual step of recursion.  This might be useful for certain situations, but not the right way to go about it.  It's a "broken recursion" functionality.

Another (hypothetical) way is to try to implement "general recursion" to try to fully implement Ackermann functions, which was (and still is) not feasible.

All this to say, the wrong way to go about it would be to say, "We cannot fully implement Ackermann, therefore we won't implement any of it."

The way they settled on was to implement "limited recursion," which would fulfill most requirements.  Basically, they applied practical limitations on these high-level languages.  Maybe it would take a lot of memory.  Maybe it would take a lot of time.  It depends on what you're doing and what your resources are.


Source of shared Link

Authors get paid when people like you upvote their post.
If you enjoyed what you read here, create your account today and start earning FREE STEEM!
Sort Order:  

Hi, @inertia!

You just got a 2.11% upvote from SteemPlus!
To get higher upvotes, earn more SteemPlus Points (SPP). On your Steemit wallet, check your SPP balance and click on "How to earn SPP?" to find out all the ways to earn.
If you're not using SteemPlus yet, please check our last posts in here to see the many ways in which SteemPlus can improve your Steem experience on Steemit and Busy.

Hi @inertia!

Your post was upvoted by @steem-ua, new Steem dApp, using UserAuthority for algorithmic post curation!
Your UA account score is currently 6.527 which ranks you at #153 across all Steem accounts.
Your rank has not changed in the last three days.

In our last Algorithmic Curation Round, consisting of 200 contributions, your post is ranked at #157.

Evaluation of your UA score:
  • You've built up a nice network.
  • The readers appreciate your great work!
  • Try to work on user engagement: the more people that interact with you via the comments, the higher your UA score!

Feel free to join our @steem-ua Discord server

We must have the same YouTube feed. Of course you understand it when you watch it, but if anyone ever sees my feed they will THINK I am super smart. That is half the battle.

We must have the same YouTube feed. Of course you understand it when you watch it, but if anyone ever sees my feed they will THINK I am super smart. That is half the battle.

hi i need your help can you help me?https://discordapp.com/invite/GNMJdqC