Ex Machina [10 - 50]

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

The work of art in the age of mechanical reduction. [62]

The possibility of parallel functions. [50]

S↓E→4243444546474849505152535455565758
222434323321322233
323322342444244534
431344443344443332
543433443334533423
633434432332433333
722324331322312232
822434332422313333
923322223554255554
1044545443343544444
1144334334223442332
1233223323412331221
1332322332323422312
1433211231354454444
1534234242244354444
1643433443434533323
1742435542245554443
1844444444333443433
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