Ex Machina [4 - 32]

The human above the machine. [40]

The machine continues, and breaks down. [32]

S↓E→2425262728293031323334353637383940
143234432434232433
232423343343144322
335443344434354453
453222432233132331
544323443343144442
643413333254244433
732221232332233113
843332343443344224
915444134442344553
1054324424145335543
1144433532254434432
1233443441443353323
1333224332332334433
1424333233323243443
1544113324221323442
1643331443443344243
1744133323324221442
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