Ex Machina [22 - 12]

and recombining [62]

The computation of parallel problems, the differing solutions. [11]

Tesseract [12]

S↓E→4567891011121314151617181920
1422454233430422333
1533454432333023323
1624433434212203444
1713345422334340353
1834543541223312135
1933543243211233204
2042143522334434250
2124454334322343314
2213244222333322331
2331344542323313242
2433554344431433424
2524332333434431442
2632344521234232242
2725444333323312344
2814324523334332453
2935465244543544333
3032244511234323141
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