Ex Machina [10 - 20]

Malfunctioning perfectly, a clicking abortion. [20]

S↓E→1213141516171819202122232425262728
232333333443332423
332132311435235443
432323134254253222
521222314535344323
622332324244443413
712311233433332221
823422344544343332
954244433433315444
1033443435155554324
1113332314434444433
1203233324433333443
1310113333434233224
1443042233324124333
1533302332334444113
1621220344444343331
1733434035344344133
1822331213525454342
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