In Cybertext: Perspectives on Ergodic Literature, Espen J. Aarseth introduces the notion of cybertext. Rather than a sequence of signifiers cybertext (cf. cybernetics) denotes a textual machine, a mechanical device for generating signifiers. Montford adds the distinction between two types of automata: linear bounded automata and Turing machines. A finite automaton allows for a finite number of inputs, which it either accepts or rejects and with which it accomplishes computational tasks. A Turing machine theoretically allows for an infinite number of different operations. Nelson defined hypertext as "non-sequential writing." Since (static) hypertext consists of a certain number of nodes connected by links, the number of possible pathways is ...