CharlesCNorton commited on
Commit ·
9d8fd84
1
Parent(s): b3106d8
Rename to threshold-computers (heading, citation, URL)
Browse files- README.md +5 -5
- tools/play.py +1 -1
README.md
CHANGED
|
@@ -13,9 +13,9 @@ tags:
|
|
| 13 |
- akida
|
| 14 |
---
|
| 15 |
|
| 16 |
-
#
|
| 17 |
|
| 18 |
-
A Turing-complete
|
| 19 |
|
| 20 |
```
|
| 21 |
output = 1 if (Σ wᵢ·xᵢ + b) ≥ 0 else 0
|
|
@@ -706,12 +706,12 @@ llm_integration/ SmolLM2 extractor + circuit wrapper + traini
|
|
| 706 |
## Citation
|
| 707 |
|
| 708 |
```bibtex
|
| 709 |
-
@misc{
|
| 710 |
-
title={
|
| 711 |
author={Norton, Charles},
|
| 712 |
year={2026},
|
| 713 |
howpublished={Hugging Face},
|
| 714 |
-
url={https://huggingface.co/phanerozoic/
|
| 715 |
}
|
| 716 |
```
|
| 717 |
|
|
|
|
| 13 |
- akida
|
| 14 |
---
|
| 15 |
|
| 16 |
+
# threshold-computers
|
| 17 |
|
| 18 |
+
A family of Turing-complete machines implemented entirely as threshold logic gates. Every gate, from Boolean primitives to arithmetic to control flow, is a single threshold neuron of the form:
|
| 19 |
|
| 20 |
```
|
| 21 |
output = 1 if (Σ wᵢ·xᵢ + b) ≥ 0 else 0
|
|
|
|
| 706 |
## Citation
|
| 707 |
|
| 708 |
```bibtex
|
| 709 |
+
@misc{threshold-computers,
|
| 710 |
+
title={threshold-computers: A Family of Turing-Complete Threshold-Logic Machines},
|
| 711 |
author={Norton, Charles},
|
| 712 |
year={2026},
|
| 713 |
howpublished={Hugging Face},
|
| 714 |
+
url={https://huggingface.co/phanerozoic/threshold-computers}
|
| 715 |
}
|
| 716 |
```
|
| 717 |
|
tools/play.py
CHANGED
|
@@ -1,5 +1,5 @@
|
|
| 1 |
"""
|
| 2 |
-
Hands-on playground for the
|
| 3 |
|
| 4 |
Loads a safetensors model, reads its manifest, and exercises threshold
|
| 5 |
circuits at every level: raw Boolean gates, 8-bit ALU arithmetic and
|
|
|
|
| 1 |
"""
|
| 2 |
+
Hands-on playground for the threshold-computers family.
|
| 3 |
|
| 4 |
Loads a safetensors model, reads its manifest, and exercises threshold
|
| 5 |
circuits at every level: raw Boolean gates, 8-bit ALU arithmetic and
|