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

It’s an open question if it is decidable to show that P=NP problem is decidable :). We may live in a universe where undecidable problems exist and it may not ever be possible no show that they are undecidable. Which imho is kind of beautiful. Even if we live in a simulation it is so incomprehensible that it might as well be God to us.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: