Ex Machina [39 - 30]

I am going to persist
in this evasion. [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 the measure of all things” [30]

S↓E→2223242526272829303132333435363738
3153543335403442434
3244552335140342244
3333423343234034235
3453343443234403325
3553443123332430343
3624544224332542053
3744353342342442405
3824413323433433430
3953443354434433435
4044433113241453342
4114454133343553444
4233343331233432344
4331422233313223333
4454254453433533516
4543165542424424525
4643243442234433325
4743332332123342244
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