🚀 go-pugleaf

>But in *practice* most loops cycle through a very small set of states.
>This is true of nearly all the infinite loops I've seen, both in my code
>and in code I've had to maintain.
>
>There will always exist programs of length n that run for 2^2^{kn}
>steps before stopping. In *practice* very few programs exhibit such
>behavior.

Oh, how faux profund. You can write an analyzer for any practical program.
And what is a practical program? One for which you can write an analyzer.
-- 
|-In compliance with DoC,---------------------Steven Ryan----------------------|
| this posting is devoid         |            2400 Geng Road, Palo Alto, CA    |
| of all information.            |            smryan@wyrmham.clipper.ingr.com  |
|-And Oliver North married William Secord/and gave birth to a little Teheran.--|