Ex Machina [40 - 53]

The poem continues: [28]

But in fact it is the garden that moves. [38]

Or, perhaps motion is an illusion, as in the case of the book that reads you at its leisure. [7]

The author intervenes. [54]

It is not just a game. [42]

The option that disturbs most thoroughly. [53]

S↓E→4546474849505152535455565758596061
3244354245544534445
3344334154342243315
3423143443244434234
3533342234533423334
3643443334543433444
3725431454555544244
3833442333423143334
3933443433433423434
4035442355645344345
4132342355555544344
4224122443144443234
4334333344332241315
4414342554455555343
4503333555355645352
4620133443344445232
4723033332233344123
4832203354355544344
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