Ex Machina [23 - 33]

A. I. [33]

S↓E→2526272829303132333435363738394041
1541133242213234423
1633314434433442435
1741333233242214423
1843425433443433435
1943332333332444425
2042234143353254423
2154443414443545236
2243233232442334421
2334324342142343324
2454443344313435545
2502344343342324332
2630334133133134322
2743022444442433535
2823304433442431324
2965450434524536443
3041224032243143412
3143335403442434125
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