Ex Machina [30 - 54]

The machine's needs. [11]

Tesseract [12]

A parallax machine, which produces parallaxes. [55]

The conversion of energy. [8]

Let thine own self be true. [54]

S↓E→4647484950515253545556575859606162
2212432444544433331
2343442454433344251
2422424543555453443
2523333324333444242
2644441344533434242
2743314445444342443
2845534445342434353
2933144654666554533
3044432345534434342
3145544445444335353
3243542455445344451
3343341543422433153
3431434432444342344
3533422345334233341
3634433345434334442
3754314545555442443
3834423334231433342
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