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

Well, assembly languages are generally Turing complete. Not sure what the parallel would be in proof engines.




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

Search: