Ex Machina [64 - 28]

And believe that you see something. [47]

A forest of fire. [30]

The machine copied, [40]

The poem continues: [28]

S↓E→2021222324252627282930313233343536
4823131543443434134
4932332422313333313
5043345522343433231
5142332233433334334
5233222133343223233
5342422332223223314
5443323233223233334
5533222444334443235
5632255133353324433
5744324222333233223
5843333233233334324
5942442545323345344
6033223133423233334
6132432433322334323
6233445432242314332
6342555434543354534
6432544434432344533
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