Decidability is whether one can statically determine if an algorithm halts for a... | Hacker News

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

samatman on May 21, 2024 | parent | context | favorite | on: Regular expression matching can be simple and fast...

Decidability is whether one can statically determine if an algorithm halts for a given input. NFAs halt for all inputs, by construction.

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