Ex Machina [64 - 36]

And believe that you see something. [47]

A forest of fire. [30]

reproduces. [36]

S↓E→2829303132333435363738394041424344
4844343413435532332
4931333331324424422
5034343323124522433
5143333433434334222
5234322323334323313
5322322331433315312
5422323333442234113
5533444323543343333
5635332443334423444
5733323322343234213
5823333432422234331
5932334534434445342
6042323333434133113
6132233432334424122
6224231433233413344
6354335453435445345
6443234453335434244
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