Ex Machina [30 - 32]

The machine conceived. [10]

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

S↓E→2425262728293031323334353637383940
2234323323244233442
2353432434214234332
2405444334431343554
2540234434334232433
2653033413313313432
2734302244444243353
2852330443344243132
2926545043452453644
3054122403224314341
3154333540344243412
3255233514034224452
3342334323403423523
3434344323440332543
3544312333243034341
3654422433254205341
3735334234244240553
3841332343343343023
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