Rudolf Kaehr

Morphogrammatics of Reflection

Rudolf Kaehr — Tue, 16 Nov 2010 06:44:09 PST

Turning back from the studies of morphogrammatics to some open questions of reflectional programming, the recountered problematics might be put into a different light and new methods of handling formal aspects of reflection and reflectionality shall be introduced. Albeit the use of light-metaphors, morphogrammatic reflection is not sketched along the paradigm of optical metaphors. Morphograms are presenting neither propositions nor perceptions able for mirroring (representation). Exercises in defining morphogrammatic retro-grade recursion and reflection schemata are continued from the paper “Sketches to Morphogrammatic Programming”.

From Universe to Polyverses

Rudolf Kaehr — Sun, 26 Sep 2010 11:51:45 PDT

Some thoughts about the power of speculation behind important discoveries in mathematics, physics and computer science. The exercise shows that there is no need for a compulsory ultimate unifying universe. It is speculated that just this paradigm of a single ultimate universe is unmasking itself today as the main obstacle for further development in Western science and technology.

Morphogrammatics for Dummies: The Domino Approach

Rudolf Kaehr — Sun, 26 Sep 2010 11:49:06 PDT

Dominoes, morphograms, cellular automata, memristics. Topics: possible continuation, coalitions, cooperations, substitution, morphic bisimilarity.

Sketch of a Typology of Abstract Memristic Machines

Rudolf Kaehr — Sun, 26 Sep 2010 11:45:40 PDT

A typology of memristic machines is sketched. This sketch gives an overview and orientation to the paper “Towards Abstract Memristic Machines”. It also intents to propose a concise systematization of the newly introduced terms and strategies to memristics and morphogrammatics. This sketch is introducing four types of sign-use for four types of machines of fundamentally different paradigms: 1. semiotic, 2. monomorphic, 3. polymorphic and 4. bisimilar abstract machines. Further definitions of abstract machines have to be based on those graphematic notational systems. A realization of such constructions of abstract machines, in contrast to existing abstract machines of the theory of automata, might be an interesting exercise for the reader.

Towards Abstract Memristic Machines

Rudolf Kaehr — Sun, 26 Sep 2010 11:42:20 PDT

Memristics: Memristors, again? – Part II, How to transform wired ‘translations’ between crossbars into interactions?

Rudolf Kaehr — Sun, 25 Apr 2010 12:25:34 PDT

The idea behind this patchwork of conceptual interventions is to show the possibility of a “buffer-free” modeling of the crossbar architecture for memristive systems on the base of a purely difference-theoretical approach. It is considered that on a nano-electronic level principles of interpretation appears as mechanisms of complementarity. The most basic conceptual approach to such a complementarity is introduced as an interchangeability of operators and operands of an operation. Therefore, the architecture of crossbars gets an interpretation as complementarity between crossbar functionality and “buffering” translation functionality. That is, the same matter functions as operator and at once, as operand – and vice versa. Hence, the construction of an additional devise for translations between crossbars is conceptionaly an inheritance of the old paradigm of (mirco)electronic computation, and probably or hopefully, superfluous. The exercise is concertized by a an example of the conceptual architecture of a multi-crossbar arithmetic processor in the sense of Blaise Laurent Mouttet’s patent.  Nevertheless, a new challenge arises, how to realize on a nano-technological level functional interchangeability of any complexity and complication?

Memristics: Memristors, Again?

Rudolf Kaehr — Fri, 16 Apr 2010 08:15:40 PDT

This collection gives first and short critical reflections on the concepts of memristics, memristors and memristive systems and the history of similar movements with an own focus on a possible interplay between memory and computing functions, at once, at the same place and time, to achieve a new kind of complementarity between computation and memory on a single chip without retarding buffering conditions.

Paul Feyerabend's Telegram

Rudolf Kaehr — Tue, 08 Sep 2009 06:55:54 PDT

6-page telegram from Paul Feyerabend (London) to Rolf Kaehr (Westberlin)

Telegram 1 I am ill. Please let the seminar continue in my absence. Inform Prof Landmann and Prof Huebner, cancel the hotel reservation and read the following final message to my class on tuesday 1pm:

I am sorry that I cannot give what

Telegram 2 would have been my last lecture to you. In this lecture I would have elaborated on Verons argument and would have tried to show that it also excludes consience, self expression, identification. Turning back to the empiricist methodology and demand for theoretical unification I would have

Telegram 3 shown how these two elements gave first, to a clearly defined and theoretically unobjectionable concept of witchcraft and then to systematic methods for the elimination of the wicked. It was the combined search for a coherent truth and for a simple good that was responsible for the

Telegram 4 death of hundreds of thousands of innoncent people. Is it not advisable to once and for all cut the ground from underneath such excesses? Is it not better to have a patchwork of vague and rambling suggestions rather than a beautiful and coherent theoretical system? Is it

Telegram 5 not better to be unsystematic and not to accept any one of the demands of theoretical excellence defended today? This is my question to you. And now thank for your kind interest in my unsystematic sermons, special thanks to the pretty girls who were and added

Telegram 6 motive for making these sermons as entertaining as possible and always remember Cohn Bendit who says that "The revolution must be born of joy and not of sacrifice" . Paul Feyerabend

Paul Feyerabend, Against Method (typoscript 1969)

Rudolf Kaehr — Tue, 08 Sep 2009 06:47:54 PDT

Facsimile of Paul Feyerabend's AGAINST METHOD

Original typoscript of Against Methods from 1968 with handwritten corrections.

Last sentence, p. 116: "We must take care that it does not lose its ability to make such a choice."

Dynamic Semantic Web

Rudolf Kaehr — Sat, 25 Jul 2009 08:22:08 PDT

Dynamic Semantic Web (DSW) is based at ﬁrst on the techniques, methods and paradigms of the emerging Semantic Web movement and its applications.

DSW is advancing one fundamental step further from a static to a dynamic concept of the Semantic Web with extended ﬂexibility in the navigation between ontologies and more profound transparency of the informational system. Web Services are now redeﬁnded by Semantic Web. To proof the advantages of DSW, it is the main aim of this project to develop the tools and methods necessary to develop a DSW based Web Service (DSW business application).

The existing framework of the Semantic Web has only very limited possibilities of realizing dynamism. It´s dynamism is reduced to inter-ontological transactions (translations, mappings, navigation) between different local taxonomies and ontologies.

DSW is based on the genuinely dynamic ﬁrst-order ontologies and logics founded in kenogrammatics of the theory of polycontexturality allowing evolution and metamorphosis to create complex interactivity and new domains of interaction.

The Chinese Challenge. Hallucinations for other futures

Rudolf Kaehr — Wed, 22 Jul 2009 03:20:15 PDT

The main question is: What can we learn from China that China is not teaching us? It is proposed that a study of polycontextural logic and morphogrammatics could be helpful to discover this new kind of rationality.

The Chinese Challenge :: 中国挑战

Rudolf Kaehr — Wed, 22 Jul 2009 03:13:30 PDT

"The Chinese Challenge"-Teamblog is opening up a discussion about a possible new rationality hidden in the Chinese writing. The main question is: What can we learn from China that China is not teaching us? It is proposed that a study of polycontextural logic and morphogrammatics could be helpful to discover this new kind of rationality.

'Lernen' in Maschinen und lebenden Systemen (with E. von Goldammer)

Rudolf Kaehr — Fri, 17 Jul 2009 05:49:15 PDT

Problems of Autonomy and Discontexturality in the Theory of Living Systems (with E. von Goldammer)

Rudolf Kaehr — Fri, 17 Jul 2009 05:39:48 PDT

Poly-Contextural Modeling of Heterarchies in Brain Functions

Rudolf Kaehr — Fri, 17 Jul 2009 05:33:15 PDT

All Hebbian rules which are discussed in the literature of neuromorphic nets are embedded within the principle of ultrametricity corresponding directly to hierarchical structures. In order to describe and to model simultaneously distributed parallel neural activities as they occur in heterarchically organized systems (self-referentiality) which cannot be linearized, a formal system for an adequate description of structural circularities and ambiguities is necessary. A basis for such a formal system is given by the theory of poly- contexturality, in which multi-negational operators regulate the duality principles of complementarity, and transjunctional operators produce muiti-simultaneous heterarchical structures.

Again, Computers and the Brain (with E. von Goldammer)

Rudolf Kaehr — Fri, 17 Jul 2009 05:29:26 PDT

Theoretical analyses of the logical structure for an adequate ´theory of living systems´ reveal the shortcomings of all standard logical systems ranging from two-valued Aristotelian logic to n-valued types eulogized by Post, Lukasiewicz and others. All these calculi have one thing in common that makes them completely inadequate for any formalization of self-referential systems, i.e., all living systems; they are essentially linear. ´Linear´ in the technical sense of being one-dimensional, since all logical statements are arranged in an ordered, unique sequence of numbers, resulting in pure hierarchically structured organizations. Self-reference, however, derives only from heterarchical structured Systems. Günther developed a formal, codifiable system of mathematical logic (´theory of poly-contexturality´) which goes beyond all multi-valued logics that have been common up to now, and possesses the ability to describe heterarchically structured systems in a formal mathematical sense. In other words, the ´theory of poly-contexturality´ provides the theoretical basis for simulating self-reflecting processes (cognition) on logical machines. The subject is considered in connection with McCulloch´s study on a heterarchy of values determined by the topology of nervous nets.

Transdisziplinarität in der Technologieforschung und Ausbildung (with E. von Goldammer)

Rudolf Kaehr — Fri, 17 Jul 2009 05:22:44 PDT

Gödel Games: "Cloning Gödel's Proofs"

Rudolf Kaehr — Thu, 16 Jul 2009 08:08:36 PDT

Gödel's Proofs in the context of beautifying (Hehner) and re-beautifying in polycontextural logic. Deconstruction of the relevance.

PolyLogics. Towards a Formalization of Polycontextural Logics

Rudolf Kaehr — Thu, 16 Jul 2009 07:59:43 PDT

Lambda Calculi in Polycontextural Situations

Rudolf Kaehr — Thu, 16 Jul 2009 07:55:27 PDT