Ex Machina [10 - 30]

Biding time, until the day all circuits complete. [32]

The machine as psychoanalyst. [30]

S↓E→2223242526272829303132333435363738
233324233433431443
352354433444343544
442532224322331323
553443234433431444
644434133332542444
733322212323322331
843433323434433442
933154441344423445
1055543244241453355
1144444335322544344
1233334434414433533
1342332243323323344
1441243332333232434
1544441133242213234
1643433314434433442
1743441333233242214
1854543425433443433
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