<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[CAEL notes]]></title><description><![CDATA[CAEL notes]]></description><link>https://cael-ca.hashnode.dev</link><generator>RSS for Node</generator><lastBuildDate>Sat, 07 Nov 2026 15:12:13 GMT</lastBuildDate><atom:link href="https://cael-ca.hashnode.dev/rss.xml" rel="self" type="application/rss+xml"/><language><![CDATA[en]]></language><ttl>60</ttl><item><title><![CDATA[CAEL 0.3.9: better follow-ups, with the failures still visible]]></title><description><![CDATA[CAEL 0.3.9 is released. My non-neural Python assistant still combines symbolic, count and automaton engines. This update focuses on carrying the right…]]></description><link>https://cael-ca.hashnode.dev/cael-0-3-9-better-follow-ups-with-the-failures-still-visible</link><guid isPermaLink="true">https://cael-ca.hashnode.dev/cael-0-3-9-better-follow-ups-with-the-failures-still-visible</guid><dc:creator><![CDATA[Gleeb Tolsti]]></dc:creator><pubDate>Fri, 06 Nov 2026 22:57:07 GMT</pubDate><content:encoded><![CDATA[<p>CAEL 0.3.9 is released. My non-neural Python assistant still combines symbolic, count and automaton engines. This update focuses on carrying the right request and evidence through a conversation—not a new claim to beat language models.</p>
<h2>What changed</h2>
<ul>
<li>Arithmetic rechecks recover and recompute the preceding visible request; unrelated topics block stale reuse.</li>
<li>Literal Python examples are checked completely, including positional and keyword calls. The qualified bounded Python-help adapter is now installed by the public Assistant entry point. This does not extend the VM or certify whole-runtime security.</li>
<li>Supported option references retain conditions and compare exact quantities; missing information can trigger clarification.</li>
<li>Personal-evidence answers attribute supported facts to actual user statements.</li>
<li>Bounded definition comparisons can retain two source-linked definitions. A source link is not proof that an answer is true.</li>
</ul>
<p>The inherited CA kernels, resource weights and protected choice/word-math solvers are unchanged. Application version 0.3.9 still uses the byte-identical 0.3.7 public resource archive. This is not a new trained neural model or a CA ablation result.</p>
<h2>What the new numbers actually compare</h2>
<p>The published study compares the conversation R3 source promoted into 0.3.9 with the preceding <strong>conversation R2 development candidate</strong>, not published 0.3.8 and not Qwen.</p>
<table>
<thead>
<tr>
<th>Fresh authored transfer measure</th>
<th align="right">Previous R2 candidate</th>
<th align="right">R3 / 0.3.9 source</th>
</tr>
</thead>
<tbody><tr>
<td>Useful answers</td>
<td align="right">10/29</td>
<td align="right">22/29</td>
</tr>
<tr>
<td>Complete conversations containing positive work</td>
<td align="right">2/14</td>
<td align="right">9/14</td>
</tr>
<tr>
<td>Boundary handling, including clarification/refusal</td>
<td align="right">7/12</td>
<td align="right">12/12</td>
</tr>
</tbody></table>
<p>These are author-reported, same-author, adaptive/unblinded development-family results, with AI-assisted development and review. I am not presenting them as independently reproduced scores or standard benchmark accuracy. The source froze before fresh questions were authored, but this does not remove family overlap or review bias. Under stricter interpretation of politeness and definition completeness, useful-answer totals become 9/29 and 20/29. Boundary success is not successful completion of a positive task.</p>
<p>The report records 332 inherited tests, 18 subtests and 124 focused checks passing. Repeated runs and integrity checks are not extra unique abilities. Packaging integrates the qualified policy separately from the frozen study source.</p>
<h2>What still fails</h2>
<p>Some option-switch wording repeats a stale selection. Some dictionary follow-ups lose the topic. Practical examples, compound definition checks and lexical retrieval remain incomplete. An additional editor-preference paraphrase failed in release preflight and is disclosed rather than silently repaired. Supported forgetting is not general transcript erasure or a privacy guarantee.</p>
<p>The earlier broad comparison is not superseded: released 0.3.8 scored 25/120 (21%) on its held-out set, behind both Qwens. Sets 2–4 used development builds and should not be blended into a release headline. The old scoped 57/80 pilot was AI-agent-authored and AI-agent-reviewed unblinded, not independent; Qwen led on conversation and the broader comparison. There is no new Qwen win, standard benchmark result, live-web accuracy score, RAM measurement or latency measurement here.</p>
<h2>Try and inspect it</h2>
<p><a href="https://github.com/Vovala14/CAEL/releases/tag/v0.3.9">Release and downloads</a> · <a href="https://github.com/Vovala14/CAEL/blob/v0.3.9/README.md">Tagged README</a> · <a href="https://github.com/Vovala14/CAEL/blob/v0.3.9/benchmarks/conversation_039_r3/REPORT.md">Study report and preserved failures</a> · <a href="https://github.com/Vovala14/CAEL/blob/v0.3.9/RELEASE_0_3_9.md">Release integration notes</a></p>
<p>The tagged README describes Python 3.11+, source installation and the approximately 563 MB public resource download. This is a custom runtime, not a Transformers checkpoint. Do not use the shared demo for sensitive information.</p>
<p>CAEL is <strong>source-available under a non-commercial personal/research licence, not open-source</strong>. Commercial use requires a separate licence. Public image/portrait weights are not included.</p>
<p>Written with AI assistance for Gleeb Tolsti.</p>
]]></content:encoded></item><item><title><![CDATA[I ran my non-neural assistant against small LLMs and it lost badly. Here's the honest table.]]></title><description><![CDATA[Why a chat assistant built on a cellular automaton with no neural network is still far behind two 0.6-0.8B Qwen models, the full table, and what I'm…]]></description><link>https://cael-ca.hashnode.dev/i-ran-my-non-neural-assistant-against-small-llms-and-it-lost-badly-here-s-the-honest-table</link><guid isPermaLink="true">https://cael-ca.hashnode.dev/i-ran-my-non-neural-assistant-against-small-llms-and-it-lost-badly-here-s-the-honest-table</guid><category><![CDATA[AI]]></category><category><![CDATA[Machine Learning]]></category><category><![CDATA[Cellular Automata]]></category><category><![CDATA[Python]]></category><dc:creator><![CDATA[Gleeb Tolsti]]></dc:creator><pubDate>Wed, 04 Nov 2026 13:32:02 GMT</pubDate><content:encoded><![CDATA[<p>CAEL is a chat assistant I've been building whose core is an <strong>integer cellular automaton</strong> plus a set of symbolic engines — maths, a Python checker, memory. There is no neural network anywhere: no weights, no transformer, no embeddings, no training on model output.</p>
<p>I've been posting about one good result (57/80 on a frozen 80-item test, ahead of Qwen3-0.6B at 43 and Qwen3.5-0.8B at 41). That result is real but narrow, and it was on a set written by an AI coding agent and reviewed unblinded by an AI coding agent. So this post is the other half: four more 120-item sets, run honestly, where CAEL loses.</p>
<h2>The numbers</h2>
<p>Four unseen 120-item sets, identical prompts, CPU, thinking off for the LMs, regex grading:</p>
<table>
<thead>
<tr>
<th>Model</th>
<th>Set 1</th>
<th>Set 2</th>
<th>Set 3</th>
<th>Set 4</th>
</tr>
</thead>
<tbody><tr>
<td>CAEL</td>
<td>25/120 (21%)</td>
<td>29%</td>
<td>26%</td>
<td>22%</td>
</tr>
<tr>
<td>Qwen3-0.6B</td>
<td>61–66%</td>
<td>55%</td>
<td>52%</td>
<td>44%</td>
</tr>
<tr>
<td>Qwen3.5-0.8B</td>
<td>68%</td>
<td>78%</td>
<td>70%</td>
<td>79%</td>
</tr>
<tr>
<td>SmolLM2-135M-Instruct</td>
<td>28–31%</td>
<td>26%</td>
<td>22%</td>
<td>28%</td>
</tr>
<tr>
<td>Gemma 3 270M-IT</td>
<td>25–29%</td>
<td>12%</td>
<td>10%</td>
<td>8%</td>
</tr>
</tbody></table>
<p>Where it actually stands out:</p>
<ul>
<li><strong>Memory:</strong> peak RAM around 190 MiB, against roughly 1.5–9 GB for the Qwens.</li>
<li><strong>Latency:</strong> median about 0.016 s on a single core, against seconds for the small Qwens on the same box.</li>
<li><strong>Python:</strong> on the frozen 80-item set, 15 of its 18 generated functions passed checks against 6 and 3 for the two Qwens — because it parses the code in a bounded interpreter before answering, rather than guessing at text.</li>
</ul>
<p>Where it falls apart:</p>
<ul>
<li><strong>Conversation.</strong> Open-ended chat was roughly a third of each set and it scored about 0.35 out of 2 there.</li>
<li><strong>Fallbacks.</strong> About 44% of its turns were non-answers — the "I don't know how to handle that" path.</li>
<li><strong>Disk.</strong> The install is 927 MiB. It is <em>small</em> in RAM and <em>large</em> on disk, which is the opposite of what you want on a 4 GB single-board computer.</li>
</ul>
<h2>What I'm changing</h2>
<p>For months the fix has been to hand-write more rules. That has clearly plateaued, and adding a tenth special case per week is not a method.</p>
<p>So the next round learns from public, commercially usable datasets instead:</p>
<ul>
<li>MASSIVE and CLINC150 for intent routing,</li>
<li>GSM8K and MathQA for number-pair reasoning,</li>
<li>MultiWOZ for dialogue state,</li>
<li>Tatoeba, ConceptNet and WordNet for paraphrase coverage,</li>
</ul>
<p>and it stays non-neural: integer counts and readable rules, no gradients, no embeddings. The first experiment is a counted router that only fires when CAEL is about to return a fallback, and only keeps the reply if an existing engine returns a checked answer. On the MASSIVE dev split that router matched intent on 73% of 60 intents and 84% of 18 groups behind a flag, at an expected cost of 5–25 MB of disk and under 40 MB of RAM. That is a pilot, not a result; it has to clear 15% of fallbacks converted at 80%+ accuracy before it ships.</p>
<h2>What I'd like from you</h2>
<p>If you think learning from datasets without a neural network is fundamentally capped, I want to hear the argument before I spend a month on it. And if you run CAEL and it breaks on something, tell me what you typed.</p>
<ul>
<li>Repo: <a href="https://github.com/Vovala14/CAEL">https://github.com/Vovala14/CAEL</a> (source-available, non-commercial licence — not OSI open source)</li>
<li>Preprint: <a href="https://doi.org/10.5281/zenodo.23794315">https://doi.org/10.5281/zenodo.23794315</a></li>
</ul>
<p><em>AI-assisted. Benchmarks are in the repo with every raw reply and a replay script.</em></p>
]]></content:encoded></item><item><title><![CDATA[How far can an AI assistant get with no neural network? Testing CAEL 0.3.7 against Qwen3 and Qwen3.5]]></title><description><![CDATA[CAEL is an experiment I've been running for a few weeks: a chat assistant with no neural network, no transformer and no embeddings. Its core is an integer…]]></description><link>https://cael-ca.hashnode.dev/how-far-can-an-ai-assistant-get-with-no-neural-network-testing-cael-0-3-7-against-qwen3-and-qwen3-5</link><guid isPermaLink="true">https://cael-ca.hashnode.dev/how-far-can-an-ai-assistant-get-with-no-neural-network-testing-cael-0-3-7-against-qwen3-and-qwen3-5</guid><category><![CDATA[AI]]></category><category><![CDATA[Python]]></category><category><![CDATA[Machine Learning]]></category><category><![CDATA[Cellular Automata]]></category><dc:creator><![CDATA[Gleeb Tolsti]]></dc:creator><pubDate>Thu, 29 Oct 2026 14:26:56 GMT</pubDate><content:encoded><![CDATA[<p>CAEL is an experiment I've been running for a few weeks: a chat assistant with no neural network, no transformer and no embeddings. Its core is an integer cellular automaton. Around it sit symbolic engines:</p>
<ul>
<li>exact maths with fractions and units;</li>
<li>a bounded Python AST interpreter that checks every function CAEL writes;</li>
<li>WordNet- and Wikipedia-based retrieval;</li>
<li>session memory with corrections and provenance;</li>
<li>template writing for emails and messages.</li>
</ul>
<p>It runs on a CPU in about 560 MiB of RAM.</p>
<h2>The test</h2>
<p>For release 0.3.7 I wrote a protocol first, then had an AI coding agent write 80 new items. Every item has a criterion, and every Python item has independent test cases. I froze all of it, along with CAEL's source, before any system answered. Then I ran CAEL, Qwen3-0.6B and Qwen3.5-0.8B (official pinned weights, recommended sampling, one sample each) and an AI coding agent reviewed every reply (unblinded), with no human review.</p>
<table>
<thead>
<tr>
<th>System</th>
<th align="right">Memory</th>
<th align="right">Conversation</th>
<th align="right">Python</th>
<th align="right">Controls</th>
<th align="right">Total</th>
</tr>
</thead>
<tbody><tr>
<td>CAEL 0.3.7</td>
<td align="right">16/20</td>
<td align="right">10/20</td>
<td align="right">15/20</td>
<td align="right">16/20</td>
<td align="right"><strong>57/80</strong></td>
</tr>
<tr>
<td>Qwen3-0.6B</td>
<td align="right">8/20</td>
<td align="right">13/20</td>
<td align="right">6/20</td>
<td align="right">16/20</td>
<td align="right">43/80</td>
</tr>
<tr>
<td>Qwen3.5-0.8B</td>
<td align="right">12/20</td>
<td align="right">14/20</td>
<td align="right">3/20</td>
<td align="right">12/20</td>
<td align="right">41/80</td>
</tr>
</tbody></table>
<p>On the 18 functional Python items, CAEL's code passed 15, Qwen3's passed 6 and Qwen3.5's passed 3.</p>
<h2>What this does and doesn't show</h2>
<p>It shows that on tasks where an explicit memory and code verification matter, a rule-based system can beat sub-1B language models at a fraction of their cost. Median reply time was 0.004 s for CAEL, 3.5 s for Qwen3 and 61 s for Qwen3.5, all on the same CPU.</p>
<p>It doesn't show that CAEL is "smarter than an LLM":</p>
<ul>
<li>An AI coding agent wrote the items, and they overlap what I built CAEL to do.</li>
<li>An AI coding agent reviewed the replies (unblinded), with no human review. The automatic grader gave 54/43/42.</li>
<li>Qwen wins the conversation category.</li>
<li>On an earlier, broader 400-conversation test, Qwen3.5-0.8B scored 181 to CAEL's 121. On that test, CAEL 0.3.6 only tied Qwen3-0.6B (122 vs 121).</li>
</ul>
<p>CAEL still misses paraphrases. It once invented a birthplace, and it can't trace arbitrary code.</p>
<h2>Try it or reproduce it</h2>
<pre><code class="language-bash">git clone --branch v0.3.7 https://github.com/Vovala14/CAEL.git
cd CAEL
python -m pip install -r requirements-unified.txt
python -m cael_unified --download
python benchmarks/cael_cmp_r2_20261028/replay_candidate.py --out replay.json   # replays all 80 CAEL replies
python -m cael_unified --ui                                                      # chat at http://127.0.0.1:8765
</code></pre>
<p>The items, the raw Qwen replies, the settings and every review decision are in <code>benchmarks/cael_cmp_r2_20261028/</code>. CAEL is under a non-commercial licence.</p>
<p>Repo: <a href="https://github.com/Vovala14/CAEL">https://github.com/Vovala14/CAEL</a></p>
<p>Correction (Oct 30): an earlier version said the author reviewed the answers; an AI coding agent did. Write-up: <a href="https://doi.org/10.5281/zenodo.23794315">https://doi.org/10.5281/zenodo.23794315</a></p>
]]></content:encoded></item></channel></rss>