Ex Machina [24 - 11]

Ten words and three numbers. [14]

Apomixis [23]

True intelligence [62]

The computation of parallel problems, the differing solutions. [11]

S↓E→345678910111213141516171819
1642443343421220344
1741334542233434035
1843454354122331213
1923354324321123320
2044214352233443425
2132445433432234331
2221324422233332233
2333134454232331324
2433355434443143342
2532433233343443144
2633234452123423224
2732544433332331234
2841432452333433245
2923546524454354433
3043224451123432314
3141434452332334244
3244135452232332325
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