Note to self: the difficulty of an NP-complete problem for different inputs forms a similar fractal, does it not?
It may be the cannabis talking, but I also can't shake the feeling that this is lurking near the edge of Decidability and the Halting Problem. I wonder if there are any useful connections between P vs NP and computability.
Additional note to self: A* is quite similar to Newton's Method when you really get down to it, isn't it?
This is a brand new server run by the main developers of the project as a spin-off of mastodon.social It is not focused on any particular niche interest - everyone is welcome as long as you follow our code of conduct!