Ex Machina [52 - 33]

The poem, copied, reproduces: seeded through books. [43]

The poem, in its variations, multiplies, mutates into greater, more complex forms. [23]

A. I. [33]

S↓E→2526272829303132333435363738394041
4454453433533516446
4565542424424525345
4643442234433325434
4732332123342244323
4854344343413435532
4942231333331324424
5052234343323124522
5123343333433434334
5213334322323334323
5333222322331433315
5423322323333442234
5544433444323543343
5613335332443334423
5722233323322343234
5823323333432422234
5954532334534434445
6013342323333434133
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