Ex Machina [9 - 10]

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

A brief moment when all seems possible. [47]

A forest of fire. [30]

The machine conceived. [10]

S↓E→23456789101112131415161718
113244324334334414
202445214523233333
330335543423213231
433032345123232313
534406434512122231
613310324112233232
733234033331231123
844345104442342234
932445540445424443
1024421435023344343
1134335334401333231
1233224223330323332
1323335323431011333
1432224542334304223
1533334544323330233
1634244334342122034
1744133454223343403
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