Ex Machina [57 - 48]

Those who internalize the poem, during the course of their processing. Who are sick with desire, symptomatic, unable to continue their normal functions, who must be isolated from their previous social contacts, who excrete new poems, seed new books: whose reading mutates into a more virulent form, writing. [2]

The book that you write, to discover. [52]

A parallel, yet uneven, processing. [48]

S↓E→4041424344454647484950515253545556
4832332322033543555
4924422143203454444
5022433443530444545
5134222122233012233
5223313233142103333
5315312133313440433
5434113232223112033
5543333223124334204
5623444533442434440
5734213343333223122
5834331232223334211
5945342132344443545
6033113332233432311
6124122111324431444
6213344442431344434
6345345452444434444
6434244341444433444
Full Pathfinding Graph

Colophon

This online application automatically generates rule-abiding nonlinear readings of Ex Machina, as originally written by Jonathan Ball, whose first print edition was published by Book*Hug in 02009.

This literary stress-test assists in performing a qualitative analysis under the following hypothesis: nonlinear constructions of Ex Machina are semantically and poetically inferior to the first published linear construction. The methodology is adjustable due to lack of instruction in the original text, but the current simulation available is limited due to media porting instability. (In this case, a textuality deficiency with regards to physical media from the text's self-referential nature of itself being a printed and bounded book.)

The equivalent null-hypothesis would therefore state that rule-abiding nonlinear structures would make an equal or greater amount of sense as a linear reading of the original manuscript.

The methodology for this experiment uses an improvisation upon Edsger Dijkstra's graph-based pathfinding algorithm, unweighted. It accepts two parameters before running: starting location and desired ending location. It will then search for the shortest possible path between these two subsets. (Some possible sets of the same shortest length with different contents may exist.)


Return to Literature Index