Ex Machina [51 - 16]

The poem is not written by the author. [52]

Minds more powerful than rooms of computers. [62]

The pages of the book. [16]

S↓E→89101112131415161718192021222324
4334333331233334314
4442245435433332542
4551334324342241431
4631334324342232432
4722223324342221433
4843334324334223131
4942223233312332332
5045323341313343345
5122434432333342332
5233423332223333222
5342323222322242422
5433432342234443323
5512423313231333222
5634423343223332255
5714433331333344324
5823322222232443333
5941423334231342442
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