Ex Machina [62 - 55]

The computation of parallel problems, the differing solutions. [11]

Tesseract [12]

A parallax machine, which produces parallaxes. [55]

S↓E→4748495051525354555657585960616263
4820335435554434421
4932034544443313323
5035304445454444521
5122330122331322122
5231421033332232212
5333134404333222321
5422231120332232222
5531243342044414331
5634424344404443511
5733332231220231323
5822233342113024422
5923444435454404233
6022334323113220422
6113244314444313031
6224313444343334402
6324444344445533540
6414444334445523443
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