Ex Machina [58 - 40]

The poetry in formulae. [5]

Combine them. [35]

The cyborg as travesty. [40]

S↓E→3233343536373839404142434445464748
4834134355323323220
4933313244244221432
5033231245224334435
5134334343342221222
5223233343233132331
5323314333153121333
5433334422341132322
5543235433433332231
5624433344234445334
5733223432342133433
5834324222343312322
5945344344453421323
6033334341331133322
6134323344241221113
6214332334133444424
6354534354453454524
6444533354342443414
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