Theorem 2.4.1: There is a goto-program whose computational sequences are not described by s (i.e., not “equivalent” to any structured program).