Ex Machina [20 - 55]

The machine that you beg to be God. [6]

A confusion to which all is aligned. [11]

Tesseract [12]

A parallax machine, which produces parallaxes. [55]

S↓E→4748495051525354555657585960616263
1232341233122123232
1333232342231232323
1423135445444423323
1524224435444433512
1644343453332343434
1754224555444333533
1844433344343343424
1923243413342313332
2054334354444443533
2134354524453424443
2224324445444333313
2334424544333442513
2424245435554534433
2533333243334442424
2644413445334342422
2733144454443424431
2855344453424343533
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