3 ms·
is this not the halting problem? You can guarantee a certain depth isnt reached but you cant guarantee a recursion will unwind or anything like that
by MaxLeiter 5y ago
is this not the halting problem? You can guarantee a certain depth isnt reached but you cant guarantee a recursion will unwind or anything like that
- __s 5y agoIt's not the halting problem; it's bounding computational depth Their suggestion is essentially making stack overflow a feature in regex, & then allowing that stack depth to be tuned
- smohare 5y agoWooosh
- johncolanduoni 5y agoNo, because we’re not trying to find out if the computation will ever halt with unbounded time. It just determines if it will halt after a certain number of steps, which you can always determine by executing that number of steps and bailing out.