Nocode: Algorithmic performance and complexity: O(0)

[rvzzz]

Proof:

Where _x_ approaching infinity represents the endless possibilities.
∴

[phenax]

I think with a few more optimizations, we can do better than O(0)

[KernelDeimos]

Actually, see my reply in issue #1668 - I believe the time complexity of nocode is actually O().

[rvzzz]

good point @phenax and @kernelDeimos ...I think this needs more research indeed... And I hope someday Donald Knuth will look at this repo and it inspires him to work on _the art of computer programming - volume 5_. Although I have the feeling he knew about this theory before but didn't want to publish it. (I think the NSA has something to do with it.)