Non-deterministic algorithms explained using Stadia State Share
One of the big open questions in computer science is known as " P = NP ", meaning the question of whether (the default deterministic) P olynomial algorithms can solve the same problems as N on-deterministic P olynomial algorithms. We computer scientists are lazy fuckers who compress 40 letters into 2. Countless hours has gone into not just the research on this, but also on just wrapping your head around what "non-deterministic algorithms" really means. An algorithm is just an extremely detailed recipe for doing stuff. Non-deterministic? Does that mean you get to throw dice? Or does it depend on there not being a predetermined fate known only to a higher being? Video games to the rescue! Stadia has introduced a feature called " State Share ", in which you can share not just a screenshot or a video clip, but the entire state of the game that you're playing. Other players who own that game can then pick up from there and keep playing. Maybe later they...