Ex Machina [61 - 50]

Down into this last light. [53]

How mother would always cry. [35]

The cyborg as perfection. [62]

The possibility of parallel functions. [50]

S↓E→4243444546474849505152535455565758
4833232203354355544
4942214320345444433
5043344353044454544
5122212223301223313
5231323314210333322
5331213331344043332
5411323222311203322
5533322312433420444
5644453344243444044
5721334333322312202
5833123222333421130
5934213234444354544
6011333223343231132
6112211132443144443
6234444243134443433
6334545244443444455
6424434144443344455
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