Ex Machina [17 - 26]

The machine we believe will never think. [26]

S↓E→1819202122232425262728293031323334
933433315444134442
1035155554324424145
1114434444433532254
1224433333443441443
1333434233224332332
1433324124333233323
1532334444113324221
1644444343331443443
1735344344133323324
1813525454342543344
1920434234333233333
2025044554223414335
2131405345444341444
2233130334323323244
2324244053432434214
2442435205444334431
2544241440234434334
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