Ex Machina [41 - 52]

(a code commences to construct worlds) [22]

also arbitrary [20]

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

Any device that transmits or modifies energy. [2]

The book that you write, to discover. [52]

S↓E→4445464748495051525354555657585960
3344433415434224331
3412314344324443423
3543334223453342333
3644344333454343344
3732543145455554424
3843344233342314333
3943344343343342343
4043544235564534434
4133234235555554434
4232412244314444323
4323433334433224131
4401434255445555534
4510333355535564535
4612013344334444523
4732303333223334412
4823220335435554434
4921432034544443313
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