Ex Machina [61 - 45]

(that moment stretching) [45]

S↓E→3738394041424344454647484950515253
4835532332322033543
4924424422143203454
5024522433443530444
5134334222122233012
5234323313233142103
5333315312133313440
5442234113232223112
5543343333223124334
5634423444533442434
5743234213343333223
5822234331232223334
5934445342132344443
6034133113332233432
6134424122111324431
6233413344442431344
6335445345452444434
6435434244341444433
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