Ex Machina [26 - 35]

“the machine is going to be perfect” [36]

The machine spawns new machines. [5]

Combine them. [35]

S↓E→2728293031323334353637383940414243
1842543344343343544
1933233333244442512
2023414335325442344
2144341444354523623
2223323244233442132
2332434214234332433
2444334431343554534
2534434334232433233
2633413313313432233
2702244444243353543
2830443344243132442
2945043452453644344
3022403224314341244
3133540344243412542
3233514034224452344
3334323403423523322
3444323440332543423
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