Ex Machina [60 - 27]

What you want from the machine is the replacement of your body and mind, immortality through the continuation of work in the world beyond your death. [43]

Readers discuss, compare data; connect and reconnect. The poem is reshaped. Some variations wither. Others burn as stars, then are gone. [15]

“Man becomes, as it were, the sex organs of the machine world, as the bee of the plant world, enabling it to fecundate and to evolve ever new forms.” [27]

S↓E→1920212223242526272829303132333435
4822313154344343413
4933233242231333331
5034334552234343323
5134233223343333433
5233322213334322323
5324242233222322331
5444332323322323333
5533322244433444323
5633225513335332443
5734432422233323322
5844333323323333432
5934244254532334534
6023322313342323333
6123243243332233432
6243344543224231433
6334255543454335453
6433254443443234453
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