News for hackers. Stuff that matters.
Re:Self-driving Uber car kills Arizona woman crossing street by gugagore on Monday March 19, 2018 @09:34PM (#16625216)
There's problem classes and problem instances.

What does NP-hardness look like for self-driving car tech? non-deterministic polynomial in: number of objects? number of lanes? time steps in the planning horizon? action/observation branching factor? These things are bounded in practice.

Not saying that the computational problems aren't hard. But ending the conversation at "NP Hard" throws away too many nuances.

Re:Self-driving Uber car kills Arizona woman crossing street by igammarays on Monday March 19, 2018 @09:55PM (#16625343)
NP in the number of data points received from all its sensors.