Ex Machina [2 - 48]

The book that you write, to discover. [52]

A parallel, yet uneven, processing. [48]

S↓E→4041424344454647484950515253545556
134335444333323333
224224343233213222
336233223424442445
414313444433444433
525434334433345334
635334344323324333
734223243313223122
845224343324223133
934233222235542555
1034445454433435444
1124443343342234423
1234332233234123312
1334323223323234223
1435332112313544544
1523342342422443544
1635434334434345333
1723424355422455544
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