Ex Machina [35 - 38]

The cyborg as travesty. [40]

The poem continues: [28]

But in fact it is the garden that moves. [38]

S↓E→3031323334353637383940414243444546
2744444243353543324
2843344243132442444
2943452453644344213
3003224314341244444
3140344243412542444
3214034224452344544
3323403423523322444
3423440332543423123
3533243034341443433
3633254205341154443
3734244240553553325
3843343343023333433
3943443343504543433
4024145334240453435
4134355344453043332
4223343234442402324
4331322333323420234
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