Upload README.md with huggingface_hub
Browse files
README.md
CHANGED
|
@@ -8,7 +8,7 @@ tags:
|
|
| 8 |
- functionally-complete
|
| 9 |
---
|
| 10 |
|
| 11 |
-
# tiny-NAND-
|
| 12 |
|
| 13 |
Formally verified NAND gate. Single threshold neuron computing negated conjunction with 100% accuracy.
|
| 14 |
|
|
@@ -89,9 +89,9 @@ NAND is functionally complete - any Boolean function can be built from NAND gate
|
|
| 89 |
|
| 90 |
```bibtex
|
| 91 |
@software{tiny_nand_prover_2025,
|
| 92 |
-
title={tiny-NAND-
|
| 93 |
author={Norton, Charles},
|
| 94 |
-
url={https://huggingface.co/phanerozoic/tiny-NAND-
|
| 95 |
year={2025}
|
| 96 |
}
|
| 97 |
```
|
|
|
|
| 8 |
- functionally-complete
|
| 9 |
---
|
| 10 |
|
| 11 |
+
# tiny-NAND-verified
|
| 12 |
|
| 13 |
Formally verified NAND gate. Single threshold neuron computing negated conjunction with 100% accuracy.
|
| 14 |
|
|
|
|
| 89 |
|
| 90 |
```bibtex
|
| 91 |
@software{tiny_nand_prover_2025,
|
| 92 |
+
title={tiny-NAND-verified: Formally Verified NAND Gate},
|
| 93 |
author={Norton, Charles},
|
| 94 |
+
url={https://huggingface.co/phanerozoic/tiny-NAND-verified},
|
| 95 |
year={2025}
|
| 96 |
}
|
| 97 |
```
|