Ex Machina [64 - 26]

You turn the page. [1]

The Book of Fire. [17]

The machine we believe will never think. [26]

S↓E→1819202122232425262728293031323334
4842231315434434341
4923323324223133333
5033433455223434332
5133423322334333343
5233332221333432232
5322424223322232233
5444433232332232333
5513332224443344432
5633322551333533244
5733443242223332332
5824433332332333343
5913424425453233453
6022332231334232333
6122324324333223343
6224334454322423143
6343425554345433545
6433325444344323445
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