Ex Machina [36 - 55]

(while in secret new machines produce new needs) [11]

Tesseract [12]

A parallax machine, which produces parallaxes. [55]

S↓E→4748495051525354555657585960616263
2855344453424343533
2931446546665545332
3044323455344343423
3155444454443353534
3235424554453444513
3333415434224331532
3414344324443423442
3534223453342333412
3644333454343344423
3743145455554424434
3844233342314333422
3944343343342343434
4044235564534434522
4134235555554434422
4212244314444323431
4333334433224131523
4434255445555534341
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