Tummi Epsilon Engine - Phase 1a

• Tummi Epsilon Engine v0101, proof of concept on one SQuAD Wikipedia article
• Tummi Epsilon Engine v0201, proof of concept on all SQuAD Wikipedia articles

Tummi Epsilon Engine - Phase 1b

• Tummi Epsilon Engine v0301, proof of concept on all English Wikipedia articles
• Tummi Epsilon Engine v0302, CIA World Factbook parser
• Tummi Epsilon Engine v0303, Book1, Project Gutenberg, subset parser
• Tummi Epsilon Engine v0304, Bibleserver subset parser
• Tummi Epsilon Engine v0305, arxiv.og subset parser

Tummi Epsilon Engine - Phase 1c

• Tummi Epsilon Engine v0401, take a look into SAT, Scholastic Aptitude Test
• Tummi Epsilon Engine v0501, Pascal module
• Tummi Epsilon Engine v0502, Winograd module

Tummi Pi engine - Phase 2

• Tummi Pi engine v0101, Theta A
• Tummi Pi engine v0201, Theta B

Tummi Rho engine - Phase 3

• Tummi Rho engine v0101, Theta A
• Tummi Rho engine v0201, Theta B

Tummi Sigma Engine - Phase 4

• Tummi Sigma engine v0101, Theta A
• Tummi Sigma engine v0201, Theta B
• Tummi Sigma engine v0301, Lopez module

"If you want to make the gods laugh, start making plans." - A Greek proverb.

***updated on 2026-06-03***

• Epsilon I - interlingual Oracle AI
• Epsilon II - reasoner/analyzer module
• Epsilon III - math n algorithms on a memetic level
• Epsilon IV - Xi Calculus

If we look at the pretty basic MiniMax algorithm for playing computer chess we can classify the traversed chess game tree as 5 dimensional, 1d - squares, 2d - pieces, 3d - color, 3.5d - time runnning forward as the sequence of the game, 4d - MiniMax algorithm moving back n forth, up n down in the game tree, and 5d - the computed permuations of the game tree of the initial chess position. Hereby the causality itself navigating the negentropy is moving always forward, relatively spoken, we just change the direction in the game tree. Question remains open if such a calculus can be implemented on a memetic level -> Xi calculus.

Okay, I dropped the Frankenstein parts and am back on the track, primary goal is simply Tummi, the intended meme machine for natural language processing, then, optional, Tummii - math n algorithms, then, optional, Tummiii - the Xi calculus...seriously, the first level will be already enough to crack for me.

Hmm, okay, this started as an relative simple meme machine in mind, and now I am up to level 5 on pen n paper...

- Epsilon engine level I
- Epsilon engine level II
- Xi calculus
- Ny
- Omikron

Epsilon I was the initial intend, a meme machine for processing natural language, Epsilon II was planed as extension to map math n algorithms on an memetic level, I will not get into the details here what the other levels mean, but it is simply too off and too Frankensteiny for just an hobby project...better play some didgeridoo or alike...

To be more precise, Tummi will be only a kind of front-end to the Epsilon engine, there will be a back-end, Luther, to view and edit the knowledge graphs, and I aim for another front-end, KEN (acronym for Karl Eugen Neumann), for language translations.

I plan different pipes for the Epsilon engine, to address different kind of queries for the same memepool as knowledge graph, but I did not work out any details yet...

Epsilon and front-end code is currently Ruby, with front-ends as simple Sinatra web-applications, database with SPARQL-endpoints will probably be Fuseki from the Jena project, cos they offer RDFs reasoner and SPARUL.

The first Tummi release is aimed as an proof of concept on the SQuA-Dataset with ~500 English Wikipedia articles, we will see how far I will get with this.

Did an flowchart of Tummi v0001 based on an meme structure encoded in RDF and queried via SPARQL, note that the system is interlingual with an memepool as base knowledge graph connected via dictionaries with an lexis.

https://epsilon.app26.de/downloads/tummi-v0001.pdf

https://epsilon.app26.de/downloads/tummi-v0001.pdf.sig