Ex Machina [36 - 49]

(offering themselves in answer to the problems they pose) [41]

(lines follow lines, and in the piling lines) [27]

The water [49]

S↓E→4142434445464748495051525354555657
2844244455344453424
2934421331446546665
3024444444323455344
3154244455444454443
3234454435424554453
3332244433415434224
3442312314344324443
3544343334223453342
3615444344333454343
3755332543145455554
3833343344233342314
3954343344343343342
4045343544235564534
4104333234235555554
4240232412244314444
4342023433334433224
4464401434255445555
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