Ex Machina [43 - 23]

The poem, in its variations, multiplies, mutates into greater, more complex forms. [23]

S↓E→1516171819202122232425262728293031
3522324445344312333
3633425342454422433
3744234234435334234
3822244332441332343
3924243525344335443
4042335344443311324
4142344241445413334
4234333323334333123
4312333343142223331
4454333325425445343
4543422414316554242
4643422324324344223
4743422214333233212
4843342231315434434
4933123323324223133
5013133433455223434
5123333423322334333
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