Ex Machina [10 - 59]

The machine is waiting for when it has a use for you. [6]

Any device to which the word is applied. [27]

The water [49]

The risen stone, the shriven God. [59]

S↓E→49505152535455565758596061626364ED
233213222333132335
324442445342443124
433444433324252334
533345334234342331
623324333333242232
713223122322332334
824223133333333345
935542555542414235
1033435444444352333
1142234423323431324
1234123312212323223
1323234223123232334
1413544544442332333
1522443544443351224
1634345333234343445
1722455544433353344
1843334434334342435
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