Ex Machina [47 - 22]

A castle of sand. [2]

The book that you write, to discover. [52]

A parallel, yet uneven, processing. [48]

Light behind the screen. [22]

S↓E→1415161718192021222324252627282930
3922424352534433544
4044233534444331132
4144234424144541333
4233433332333433312
4331233334314222333
4435433332542544534
4524342241431655424
4624342232432434422
4724342221433323321
4824334223131543443
4933312332332422313
5041313343345522343
5132333342332233433
5232223333222133343
5322322242422332223
5442234443323233223
5513231333222444334
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