Ex Machina [40 - 56]

The poem continues: [28]

But in fact it is the garden that moves. [38]

And when it tires, fold you close. [56]

S↓E→4849505152535455565758596061626364
3254245544534445132
3334154342243315323
3443443244434234423
3542234533423334122
3643334543433444233
3731454555544244343
3842333423143334223
3943433433423434344
4042355645344345223
4142355555544344223
4222443144443234312
4333344332241315232
4442554455555343412
4533555355645352423
4633443344445232423
4733332233344123322
4803354355544344212
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