Ex Machina [57 - 42]

Those who process the poem, efficiently, but without effect. [54]

It is not just a game. [42]

S↓E→3435363738394041424344454647484950
4813435532332322033
4931324424422143203
5023124522433443530
5133434334222122233
5223334323313233142
5331433315312133313
5433442234113232223
5523543343333223124
5643334423444533442
5722343234213343333
5832422234331232223
5934434445342132344
6033434133113332233
6132334424122111324
6233233413344442431
6353435445345452444
6453335434244341444
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