Ex Machina [7 - 43]

The author intervenes. [54]

A miraculous event. [43]

S↓E→3536373839404142434445464748495051
123243343354443333
214432242243432332
335445362332234244
413233143134444334
514444254343344333
624443353343443233
723311342232433132
834422452243433242
934455342332222355
1033554344454544334
1143443244433433422
1235332343322332341
1333443343232233232
1424344353321123135
1532344233423424224
1634424354343344343
1722144234243554224
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