Ex Machina [19 - 41]

As you forge links in this chain. [13]

“[T]here is no a priori improbability in the descent of conscious (and more than conscious) machines from those which now exist, except that which is suggested by the apparent absence of anything like a reproductive system in the mechanical kingdom. This absence however is only apparent, as I shall presently show.” [15]

“The machine world reciprocates man's love by expanding his wishes and desires, namely, in providing him with wealth.” [26]

“the machine is going to be perfect” [36]

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

S↓E→3334353637383940414243444546474849
1154434432444334334
1243353323433223323
1332334433432322332
1423243443533211231
1521323442334234242
1643344243543433443
1724221442342435542
1844343343544444444
1933244442512322232
2035325442344545543
2144354523623433343
2244233442132231243
2314234332433544344
2431343554534222242
2534232433233342333
2613313432233444444
2744243353543324331
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