Ex Machina [43 - 50]

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

A. I. [33]

The desire: to work, to perform the task for which it was designed. [50]

S↓E→4243444546474849505152535455565758
3543433342234533423
3654443443334543433
3753325431454555544
3833433442333423143
3943433443433433423
4053435442355645344
4143332342355555544
4202324122443144443
4320234333344332241
4444014342554455555
4534103333555355645
4624120133443344445
4713323033332233344
4833232203354355544
4942214320345444433
5043344353044454544
5122212223301223313
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