Note to self: the difficulty of an NP-complete problem for different inputs forms a similar fractal, does it not?
Thinking out loud, this implies that if you can solve the fractal, i.e. compute the color of the fractal at some arbitrary position x in O(poly) time, you can solve 3-SAT in O(poly) time and you get P = NP.
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!