Ex Machina [12 - 33]

A parallax machine, which produces parallaxes. [55]

The transformation of the motion. [14]

Apomixis [23]

A. I. [33]

S↓E→2526272829303132333435363738394041
432224322331323314
543234433431444425
634133332542444335
722212323322331134
833323434433442245
954441344423445534
1043244241453355434
1144335322544344324
1234434414433533234
1332243323323344334
1443332333232434435
1541133242213234423
1633314434433442435
1741333233242214423
1843425433443433435
1943332333332444425
2042234143353254423
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