Ex Machina [25 - 28]

the words [22]

and recombining [62]

The architecture of your memory. [40]

The poem continues: [28]

S↓E→2021222324252627282930313233343536
1734434413332332422
1852545434254334434
1943423433323333324
2004455422341433532
2140534544434144435
2213033432332324423
2324405343243421423
2443520544433443134
2524144023443433423
2624345303341331331
2743443430224444424
2834335233044334424
2932242654504345245
3013355412240322431
3133535433354034424
3224445523351403422
3314334233432340342
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