Template:Conway and complexity: Difference between revisions

Template:Conway and complexity (view source)

130 bytes added , 5 November 2022

no edit summary

82,927

edits

@@ Line 9: / Line 9: @@
 The idea that [[complexity]] is merely an [[emergent]] probability of a simple [[algorithm]] is quite the piece of eliminative [[reductionism]]. Eliminative in that it eliminates complexity as discrete state. It converts all [[complex]] systems to no more than an insufficiently mapped understood simple systems.
-This is like saying — maybe it ''is'' saying —an [[analog]] signal is just an insufficiently granular [[digital]] signal. That the digital world isn't just a handy
+This is like saying — maybe it ''is'' saying —an [[analog]] signal is just an insufficiently granular [[digital]] signal. That digital code isn't just a handy way of representing the analog universe but that, if you did deep enough, ''binary code is all there is''. This is a deep implications.
 This undermines the powerful distinction between [[simple]], [[Complicated system|complicated]] and [[Complex system|complex]] systems — they are now just points along a continuum, without hard boundaries between them — and undermines the explanatory power of complexity theory. It is really just saying, “well, in this complex system, ''something'' will happen; we don’t know what, but as and when it does we will be able to rationalise it as a function of our rules, by deducing what the missing data must have been.”