Ex Machina [41 - 36]

(a code commences to construct worlds) [22]

and recombining [62]

The possibility of parallel functions. [50]

The poem is not written by machines. [36]

S↓E→2829303132333435363738394041424344
3343234034235233224
3443234403325434231
3523332430343414434
3624332542053411544
3742342442405535533
3823433433430233334
3954434433435045434
4013241453342404534
4133343553444530433
4231233432344424023
4333313223333234202
4453433533516446440
4542424424525345341
4642234433325434241
4732123342244323133
4844343413435532332
4931333331324424422
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