On Rat oo B . Litow July 31, 199 2 1 Introductio n Apologia Theoretical computer science should provide a framework in which propositions can be understood as `simple' by virtue of the conceptual connections that the theory of computatio n affords . Now it may happen that results obtained via such connections may be far fro m sharp in terms of, say, complexity bounds, but proofs that use other results as big buildin g blocks, rather than bricks can have great organizing and pedagogical power . When a resul t is presented as `simple', it becomes easier to concentrate on making new correspondence s and to see `why' certain things are true . In this spirit we give a gloss on a decision problem . The Rat Determination of whether or not a rational series has M as its set of support is called th e rational sequence problem, Rat . It is assumed that a rational series is effectively presented , e.g ., as a ratio of polynomials . There are numerous formulations of this problem . Here are two of them . 1. Does a linear recurrence over Z have a 0 term? 2. Let
/lp/association-for-computing-machinery/on-rat-RwyUM8Str3