Ex Machina [25 - 24]

the paper prepared [2]

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

A parallel, yet uneven, processing. [48]

Stained glass. [24]

S↓E→1617181920212223242526272829303132
1740353443441333233
1812135254543425433
1933204342343332333
2034250445542234143
2143314053454443414
2222331303343233232
2313242440534324342
2433424352054443344
2531442414402344343
2632242434530334133
2712344344343022444
2832453433523304433
2944333224265450434
3023141335541224032
3142443353543335403
3223252444552335140
3342331433423343234
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