Ex Machina [36 - 42]

The machine spawns new machines. [5]

Read the instruction and decode it. [13]

“Neither the book nor the sand has any beginning or end.” [57]

Those who process the poem, efficiently, but without effect. [54]

It is not just a game. [42]

S↓E→3435363738394041424344454647484950
2842431324424445534
2924536443442133144
3043143412444444432
3142434125424445544
3242244523445443542
3334235233224443341
3403325434231231434
3530343414434333422
3642053411544434433
3742405535533254314
3833430233334334423
3933435045434334434
4053342404534354423
4153444530433323423
4232344424023241224
4323333234202343333
4433516446440143425
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