Ex Machina [28 - 61]

But in fact it is the garden that moves. [38]

Or, perhaps motion is an illusion, as in the case of the book that reads you at its leisure. [7]

The author intervenes. [54]

Who once were able to believe that they were free. [51]

To eat, and grow, and change. [61]

S↓E→49505152535455565758596061626364ED
2033435444444353343
2135452445342444335
2232444544433331324
2342454433344251322
2424543555453443344
2533324333444242435
2641344533434242233
2714445444342443126
2834445342434353345
2944654666554533236
3032345534434342333
3144445444335353445
3242455445344451322
3341543422433153234
3434432444342344235
3522345334233341224
3633345434334442332
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