Ex Machina [39 - 3]

I am going to persist
in this evasion. [13]

“Neither the book nor the sand has any beginning or end.” [57]

Those who process the poem, to some effect: catalysts for mutation. [60]

You will not accept randomness. [3]

S↓E→1234567891011121314151617
3123414344523323342
3234441354522323323
3333233243433433242
3432244443333322344
3533433543441212223
3634431444441223334
3743323254313434442
3822434413443234222
3912434543444212242
4034422435433434423
4134324355333434423
4222234443333433343
4333222423433333123
4423234354224543543
4534134465133432434
4632144443133432434
4731133332222332434
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