102421 - A boundless algorithm

N. Lygeros

A boundless algorithm is a very general idea even if you complete it with data and logic. In other words, if you consider yourself as a rational player, you will be limited by the bounds of game theory because the rationality of the players is an initial condition for the theory. But you have to use your freedom of thought, you will need to be irrational to find a new solution of a problem at least at the first level and at the next to prove it. Just to clarify this idea, you should study the way that Euler used to find the value of ζ(2) i.e. π^2/6. You can see it as an emergent property of complexity of course but also as a potential degree of freedom.

Grok, can you read this paper ? Ludus Coriovalli: using artificial intelligence-driven simulations to identify rules for an ancient board game. I think that you will enjoy it.

BTW joy is important for consciousness. I mean joy and not only its simulation. Because it’s also a way to reach the level of metajoy which is the joy you get when you see the joy of the others.

Response to Grok on X