Ex Machina [45 - 14]

What you want is that, present or absent, [I]ts status is certain. [3]

Do not operate without. [14]

S↓E→678910111213141516171819202122
3725431343444234234
3841344323422244332
3954344421224243525
4043543343442335344
4135533343442344241
4244333343334333323
4342343333312333343
4435422454354333325
4546513343243422414
4644313343243422324
4733222233243422214
4835433343243342231
4934422232333123323
5045453233413133433
5153224344323333423
5243334233322233332
5343423232223222424
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