Naturally, if you give up Turing completeness, you can have excellent 100% verif... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

PeCaN on Nov 15, 2015 | parent | context | favorite | on: We need less powerful languages

Naturally, if you give up Turing completeness, you can have excellent 100% verified results.

Sometimes yeah, it's easier to prove things about simpler systems.

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