Ex Machina [25 - 19]

the words [22]

or with a purpose [46]

Shameful. [3]

Please be aware of these risks. [19]

S↓E→1112131415161718192021222324252627
1723343403534434413
1812233121352545434
1932112332043423433
2023344342504455422
2143223433140534544
2223333223313033432
2323233132424405343
2444314334243520544
2534344314424144023
2612342322424345303
2733233123443443430
2833343324534335233
2945435443332242654
3012343231413355412
3133233424433535433
3223233232524445523
3334332423314334233
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