Ex Machina [20 - 49]

The machine that you beg to be God. [6]

Any device to which the word is applied. [27]

The water [49]

S↓E→4142434445464748495051525354555657
1243322332341233122
1343232233232342231
1453321123135445444
1533423424224435444
1654343344343453332
1734243554224555444
1854444444433344343
1951232223243413342
2034454554334354444
2162343334354524453
2213223124324445444
2343354434424544333
2453422224245435554
2523334233333243334
2623344444413445334
2754332433144454443
2844244455344453424
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