Algorithmic complexity is a measure of information. For any non-trivially sophisticated (i.e. interesting) system, there exists no shortest/best programmatic representation – i.e. theory, model, framework or network wiring. This means that in some circumstances we can reduce ad infinitum. There is no best, only better; a lesson in abject humility still to be learned by […]
Tag: Undecidability
Categories
AI as Propaganda
Context: Attack Mannequins: AI as Propaganda An interesting article but the assertion of ideological counter-propaganda in this context is a bit of stretch. It projects much more structure, aptitude and volition to the behavioural and regulatory (as control/governance) systems than has ever actually existed. The assertion of all ideological positions requires a foil, an antithesis […]
Categories
A language is not its parts
The artefacts and instances as microcosms or individuated and particular salience are indeed not the essence of a linguistic system, but notice how that from within the grammatical and ordered sub-set of logic that language (inadvertently) embodies – the projective and asserted totality of intelligible meaning or self-consistent systems is some kind of statistical average […]
Context: Would you trust an AI Operative in the field? This (quote from the above article) is an assessment of limitations in current AI: “…tend to respond well to what they’ve been trained to detect, but responses can become erratic when confronted with unexpected circumstances…” is in fact, and perhaps not coincidentally, an operational and […]
Alan Turing’s proof of the undecidability of non-trivially sophisticated algorithms is sufficient reason for:• the autonomously adaptive, complex information strategies of life; and,• the intractably problematic and recursively non-terminating information transcription of cancer.
Daedelus Kite 