Ex Machina [22 - 48]

or with a purpose [46]

Trying to tell you something. [9]

A consuming fire. [29]

What you will never know. [48]

S↓E→4041424344454647484950515253545556
1435332112313544544
1523342342422443544
1635434334434345333
1723424355422455544
1835444444443334434
1925123222324341334
2023445455433435444
2136234333435452445
2221322312432444544
2324335443442454433
2445342222424543555
2532333423333324333
2622334444441344533
2735433243314445444
2824424445534445342
2943442133144654666
3012444444432345534
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