When trying to come up with hard problems in computer science I would think np h... | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

Tarean on Feb 10, 2017 | parent | context | favorite | on: Design Principles Behind Smalltalk (1981)

When trying to come up with hard problems in computer science I would think np hard, not robotics.

Building a robot to toss the ball is still hard but that is an engineering and physics problem. The calculations remain simple.

Consider applying for YC's Spring batch! Applications are open till Feb 11.
Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact