Ex Machina [59 - 53]

An infinity of strings, harps without angels. [9]

I am not responsible. I am not responsible. I am not responsible. I am not responsible. [61]

Down into this last light. [53]

S↓E→4546474849505152535455565758596061
4832203354355544344
4914320345444433133
5044353044454544445
5112223301223313221
5223314210333322322
5313331344043332223
5423222311203322322
5522312433420444143
5653344243444044435
5734333322312202313
5823222333421130244
5913234444354544042
6033223343231132204
6111132443144443130
6244243134443433344
6345244443444455335
6434144443344455234
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