Teleonomic cyborg semiotics
O.C.E.A.N., H.E.X.A.C.O. and autopoietic heterarchical hypermedia systems
- Immutability, Composition of Representation (Fodor, cognition and systematicity), Attribute Mental Model, Openness to experience
- Safety (Amundsen/Lamport), Liveness (Lamport; SAM), Fairness (Lamport), Productivity (Fodor), Capability Mental Model, Agreeableness
- Idempotence, Systematicity of Representation, Relationship Mental Model, Conscientiousness
- Presentation, Transclusion, Systematicity of Inference, Neuroticism
- Space-time, Extraversion
- Honor-Dignity (Fourthness, C.S. Hermann)
- Gossip-sharing and Truth-finding, mutual respect, cosmopolitanism
- Abandon CAP theorem, embrace CALM conjecture (using abstractions like Guesses, Apologies and Memories): Coordination-free, Identification-free, Scale-free, Confluent composition
- Scale cube (Art of scalability: Y-axis, Y-axis, Z-axis scaling)
- Language security, formal input specification languages, full input recognition, Context-free grammars, Turing-complete power and Winograd Schema Challenges
- Computational aesthetics: representationality, instrumentality, cognitivism: “The enormous workload of today’s executives is another direct consequence of the conflict between biological time and computer time.” (The Hidden Connections)
- Petri nets, STR nets, etc. instead of cognition with classical architecture à la Fodor and Pylyshyn)?
- Urban sensing (Taxi drive algorithm), Swarm algorithm, TrueNorth (cognitive computing), speculative execution, etc.
- Homomorphic and convergent encryption, Knot cryptography and encoding through concordance (sliceness), etc.
- More on cyborgism and cybersemiotics…
- Hyperlink ensembles, limitations of Zipf’s Law and Pareto optimality in modeling hypermedia communications
- Decision-usefulness versus accountability, defining predictive and historical data in momentum accounting; periodic table of information extensions to HFactor
- Bloom and Bud, declarative disorderly programming; orbital priors; probabilistic contents (Sarah Moss)
: “1. B generates a public key χ by resorting to a certain set of ‘generators’.
2. B sends the public key to A. Anyone can see it.
3. A uses the key to encrypt the message M;
4. A sends the encrypted message Mχ to B, but none can decrypt it.
5. B receives the message Mχ and, knowing the generators, is able to decrypt it.” (https://www.researchgate.net/publication/47374725_Post_Quantum_Cryptography_from_Mutant_Prime_Knots)
: “The generation of these more complex topologies may also be of interest in other applications relying on framed knots, such as quantum money.” https://www.nature.com/articles/s41467-020-18792-z