Ex Machina [23 - 14]

Arising from errors in the code [5]

Read the instruction and decode it. [13]

“The entire current 'psychological' situation is characterized by this short-circuit.” [14]

S↓E→678910111213141516171819202122
1545443233302332334
1643343421220344444
1734542233434035344
1854354122331213525
1954324321123320434
2014352233443425044
2145433432234331405
2224422233332233130
2334454232331324244
2455434443143342435
2533233343443144241
2634452123423224243
2744433332331234434
2832452333433245343
2946524454354433322
3024451123432314133
3134452332334244335
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