Ex Machina [42 - 48]

Choice governed by paranoia. [29]

What you will never know. [48]

S↓E→4041424344454647484950515253545556
3434231231434432444
3514434333422345334
3611544434433345434
3735533254314545555
3833334334423334231
3945434334434334334
4004534354423556453
4130433323423555555
4224023241224431444
4334202343333443322
4446440143425544555
4545341033335553556
4634241201334433444
4723133230333322333
4832332322033543555
4924422143203454444
5022433443530444545
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