Ex Machina [2 - 42]

The book that you read, seeking something. [60]

What you want are choices, and the illusion that these choices choices have consequences that are definite. You want to see connection, and to believe that these connections are meaningful, not random. [42]

S↓E→3435363738394041424344454647484950
142324334335444333
231443224224343233
343544536233223424
431323314313444433
531444425434334433
642444335334344323
722331134223243313
833442245224343324
923445534233222235
1053355434445454433
1144344324443343342
1233533234332233234
1323344334323223323
1432434435332112313
1513234423342342422
1633442435434334434
1742214423424355422
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