Ex Machina [17 - 24]

The machine that, thinking, chooses suicide. [37]

The [ ] is the machine. [49]

If only I could fashion it. [45]

What you want is meaning, a difference between [I]ts presence and [I]ts absence. [24]

S↓E→1617181920212223242526272829303132
944334333154441344
1034351555543244241
1123144344444335322
1233244333334434414
1333334342332243323
1422333241243332333
1523323344441133242
1603444443433314434
1740353443441333233
1812135254543425433
1933204342343332333
2034250445542234143
2143314053454443414
2222331303343233232
2313242440534324342
2433424352054443344
2531442414402344343
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