Ex Machina [30 - 16]

The machine operates. [18]

Concurrent Read Exclusive Write [16]

S↓E→89101112131415161718192021222324
2242223333223313033
2345423233132424405
2443444314334243520
2523334344314424144
2645212342322424345
2743333233123443443
2845233343324534335
2952445435443332242
3045112343231413355
3145233233424433535
3245223233232524445
3334334332423314334
3433333223443132533
3534412122232444534
3644412233342534245
3743134344423423443
3834432342224433244
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