Ex Machina [10 - 46]

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

The machine as psychosis. [5]

Read the instruction and decode it. [13]

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

Amphimixis [46]

S↓E→3839404142434445464748495051525354
232242243432332132
345362332234244424
433143134444334444
544254343344333453
643353343443233243
711342232433132231
822452243433242231
955342332222355425
1054344454544334354
1143244433433422344
1232343322332341233
1343343232233232342
1444353321123135445
1544233423424224435
1624354343344343453
1744234243554224555
1834354444444433344
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