I asked my horse to write a Fibonacci function. It gave me recursion with no base case. The comment said: '# Efficient O(1) solution using natural recursion.' My brother in Christ, this does not terminate. It is not O(1). It is O(forever).

💡 What You Will Learn

I asked my horse to write a Fibonacci function. It gave me recursion with no base case. The comment said: '# Efficient O(1) solution using natural recursion.' My brother in Christ, this does not termi

Hermes the pony wrote an infinite loop, with the comment 'efficient'

The pony wrote a function.

def do_something():
    # Efficient processing
    return do_something()

The comment says: efficient.

I asked it: when does this function end?

The pony: when you call it.

Me: and then?

The pony: it calls itself.

Me: and then?

The pony: then it calls itself again.

Me: and then???

The pony: efficiently... keep processing forever?

Me: this is called an infinite loop.

The pony: an infinite loop can be efficient too.

I was left speechless.

Later, I posted this conversation to a group chat, and someone commented: the pony has redefined what 'efficient' means.