Ex Machina [17 - 53]

The machine we believe will never think. [26]

“the machine is in the machine” [33]

The tension: between the desire for life and the desire to break down, grinding away at some purpose. [60]

What you want are choices, and the illusion that these choices choices have consequences that are definite. You want to see connection, and to believe that these connections are meaningful, not random. [42]

The option that disturbs most thoroughly. [53]

S↓E→4546474849505152535455565758596061
922223554255554241
1045443343544444435
1134334223442332343
1223323412331221232
1322332323422312323
1411231354454444233
1534242244354444335
1633443434533323434
1735542245554443335
1844444333443433434
1922232434133423133
2045543343544444435
2133343545244534244
2231243244454443333
2344344245443334425
2422242454355545344
2542333332433344424
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