Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
kmill
on May 12, 2023
|
parent
|
context
|
favorite
| on:
Problems harder than NP-Complete
Yep. Still, it turns out there's a lot you can do with non-Turing-complete languages, and it's nice knowing that a program will definitely finish.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: