Ex Machina [60 - 39]

What you want is to proceed, in some fashion: through the book, through the poem, through the world: and for this procession to seem motivated, to possess or develop meaning. [39]

S↓E→3132333435363738394041424344454647
4843413435532332322
4933331324424422143
5043323124522433443
5133433434334222122
5222323334323313233
5322331433315312133
5423333442234113232
5544323543343333223
5632443334423444533
5723322343234213343
5833432422234331232
5934534434445342132
6023333434133113332
6133432334424122111
6231433233413344442
6335453435445345452
6434453335434244341
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