Ex Machina [29 - 21]

What you know does not matter, even if you knew. [45]

What you want is [I]ts absence. [21]

S↓E→1314151617181920212223242526272829
2122343314053454443
2233322331303343233
2323313242440534324
2431433424352054443
2534431442414402344
2634232242434530334
2723312344344343022
2834332453433523304
2943544333224265450
3034323141335541224
3123342443353543335
3223323252444552335
3333242331433423343
3422344313253343443
3512223244453443123
3623334253424544224
3734442342344353342
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