Ex Machina [38 - 46]

If allowed this far, perhaps further. [25]

the words [22]

or with a purpose [46]

S↓E→3839404142434445464748495051525354
3034124444444323455
3141254244455444454
3245234454435424554
3352332244433415434
3454342312314344324
3534144343334223453
3634115444344333454
3755355332543145455
3802333343344233342
3950454343344343343
4024045343544235564
4145304333234235555
4244240232412244314
4332342023433334433
4464464401434255445
4553453410333355535
4654342412013344334
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