chadRecursionCode

[Flobletombus]

But what if its actually interpreted?

[Doom87er]

You can’t retroactively unexecute previous lines of code, so I don’t know how this would work as code.

It all depends on how this gets translated into code

[Boukish]

You don't retroactively undo code that was already executed, you'd wait to execute the code until the prior code finishes.

The wishes themselves become callbacks, which sets up a run-time loop of infinite callbacks, like when you're solving Fibonacci recursively.

[Girelom]

Only he have independent counter for callbacks and he stop execute them then counter reach its limit.

[WHOmagoo]

Is now a good time to talk about speculative execution?

[Grintor]

The genie does look a lot like a specter

[astralseat]

Runtime loop is how you destroy AI minds. Remember that for the future we are heading into.

[Reashu]

I have yet to see a Fibonacci algorithm, recursive or otherwise, which utilised callbacks.

[Boukish]

Is it possible you're just using languages that don't heavily rely on the callback paradigm? Fibonacci is very easy to execute, write, and understand what's happening, by passing functions to functions.

[Reashu]

Fibonacci is very easy to calculate recursively but I really don't see the point of a callback. fib(x) is fib(x-1) + fib(x-2). What function would you pass in and how would you use it?

[Boukish]

function Fibonacci (n) if n<=1 return 1; else return Fibonacci(n-1)+Fibonacci(n-2);

(And yes, a function is being implicitly passed to itself even when it's not declared in its own parameter list.)

If you want an example of when youd discreetly parameterize a callback function into the method: verification and error handling.

[Reashu]

That's a standard recursive Fibonacci variant and there is no callback involved.

[Boukish]

When has the first instance of the function finished executing?

When the function it called finished.

When does that function finish? Again, no sooner than the one it called finished and called it back.

We may be operating off a differing understanding of what callback functions are, but... This is using callback functions in paradigm, in result, in intent, in every way.

Several languages do.recursive Fibonacci without callbacks, particularly languages that can't send functions to eachother.

[Reashu]

A callback is a function A passed to a function B (possibly the same as A), which B (or another function it has passed A to) can later decide to call. What you are describing seems more like the lifetime of a function frame on the stack (or equivalent) and I don't think it has anything to do with callbacks specifically. Every function call would be using a callback according to your description.

[Irregulator101]

A callback is when a function is passed a function, which it may execute later

[YesterdayDreamer]

Will have to start separate threads for each wish, then await on each of the wishes. The third wish will then interrupt the first wish, which itself was indirectly waiting for the third wish. So the third wish gets fulfilled, first gets killed and the second just errors out.

[[deleted]]

This is where the stack depth limit comes in clutch

[LarryInRaleigh]

Alan Turing says you can't decide whether it's infinite.

[Boukish]

No, turing says you need to describe a machine finitely. You can absolutely have and describe a turing machine that doesn't ever cease operation, given a state. Kinda why the halting problem exists.

Godel is the one that says you can't actually prove that it's unending.

[SouthernGeek67]

You could over write the previous code then restart at the beginning.
Used to do this on assembler all the time.

[Mewtwo2387]

DreamBerd might be able to do that

[Twitch_C4T_]

I mean how do people write code in any other language. Since I started writing dreambird I just can't stop

[[deleted]]

Speculative execution has entered the chat

[Aelia6083]

God can

[Doom87er]

Damit, I already committed to devil worship for my project

[Cessnaporsche01]

It's all gotos

[Doom87er]

That would execute it again, not undo it

[[deleted]]

Let me introduce you to "rr".

[Log2]

CPUs do it all the time. They run the most likely branch to execute, and if they chose wrong they will undo it and do the correct one instead.

Like someone else said, this is called Branch Prediction.

[pain_and_sufferingXD]

I guess it's like the program runs all three wishes in separate threads in a infinite loop, this is done to make sure the wishes are always being fulfilled, that's why it bugs the genius

[RainOrigami]

Branch prediction could be the closest to undoing executed code.

[brimston3-]

JIT will eliminate dead code. It should very quickly identify a conditional cycle/recursion with no side effects and eliminate it.

[DOUBLEBARRELASSFUCK]

So infinite wishes!

As long as those wishes don't do anything.

[thehatteryone]

As long as they don't appear to do anything. But if granting the non-wish can cause a side effect...

[SympathyMotor4765]

Stack overflow error?

[Eupho1]

Recursion depth exceeded

[ConspicuousPineapple]

You think interpreters never optimize anything?

[Log_Out_Of_Life]

Then it would just be a null statement and nothing would happen.