Ex Machina [50 - 46]

The poem is not written by machines. [36]

(offering themselves in answer to the problems they pose) [41]

(a code commences to construct worlds) [22]

or with a purpose [46]

S↓E→3839404142434445464748495051525354
4244240232412244314
4332342023433334433
4464464401434255445
4553453410333355535
4654342412013344334
4743231332303333223
4855323323220335435
4944244221432034544
5045224334435304445
5143342221222330122
5243233132331421033
5333153121333134404
5422341132322231120
5533433332231243342
5644234445334424344
5732342133433332231
5822343312322233342
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