Ex Machina [58 - 60]

The poetry in formulae. [5]

Read the instruction and decode it. [13]

“Neither the book nor the sand has any beginning or end.” [57]

Those who process the poem, to some effect: catalysts for mutation. [60]

S↓E→49505152535455565758596061626364ED
4833543555443442125
4903454444331332325
5030444545444452123
5133012233132212235
5242103333223221224
5313440433322232124
5423112033223222234
5524334204441433124
5642434440444351124
5733223122023132334
5823334211302442212
5944443545440423316
6033432311322042234
6124431444431303125
6231344434333440213
6344434444553354016
6444433444552344305
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