We don't bite newbies here... much | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
> and ensure that they never enter the world of ridiculous step count.
Sidenote: Are you aware of the Halting problem?
In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running, or continue to run forever.
updatethough there is an ongoing discussion if Perl RegExes (without embedded (?{Perl code}) ) are Turing complete and which features should be stripped off to make them "uncomplete".
Cheers Rolf
In reply to Re: regex step counting (Halting problem)
by LanX
|
|