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

bounded model checking is indeed a thing, but it's bounded



A few months back I spent a couple of hours writing a binary TM simulator (yes I know you can download them - I wanted to write one) and then spent a couple of weeks running various TMs for days on end...

They exhibit quite bizarre amounts of complexity for what are really simple structures - indeed some TMs have apparently been observed employing Collatz conjecture type behaviour.


awesome!




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

Search: