Ex Machina [21 - 18]

[EFF]ACE [19]

What is revealed. [59]

An unreadable score. Unbearable music. [18]

S↓E→1011121314151617181920212223242526
1343101133334342332
1433430422333241243
1532333023323344441
1634212203444443433
1722334340353443441
1841223312135254543
1943211233204342343
2022334434250445542
2134322343314053454
2222333322331303343
2342323313242440534
2444431433424352054
2533434431442414402
2621234232242434530
2733323312344344343
2823334332453433523
2944543544333224265
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