Ex Machina [17 - 16]

The machine that will never think. [4]

The human and the machine as symbiotic, cyborg. [35]

The cyborg as science, not fiction. [27]

that you need to live [16]

S↓E→89101112131415161718192021222324
940445424443343331
1035023344343515555
1134401333231443444
1223330323332443333
1323431011333343423
1442334304223332412
1544323330233233444
1634342122034444434
1754223343403534434
1835412233121352545
1932432112332043423
2035223344342504455
2143343223433140534
2242223333223313033
2345423233132424405
2443444314334243520
2523334344314424144
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