polymetron

4 ms·

1. 1.▲
   Show HN: Computational Metaphysics: Zeroth Implementation of Grover's and Shor's(polymetron.substack.com)

   2 points by polymetron 11mo ago|0 comments
2. 2.▲
   by polymetron 1y ago

   https://github.com/ElSolem/al_dara_ia/blob/main/heimdalle/cp... https://github.com/ElSolem/al_dara_ia/blob/main/heimdalle/ma...
3. 3.▲
   Show HN: Adventures in UTM – Busy Beaver in under 5–10 mins

   2 points by polymetron 1y ago|2 comments
4. 4.▲
   by polymetron 1y ago

   I added a new PDF to the repository showing node scale and performance analysis (up to 100k x 100k grids, 10 billion nodes). If you're curious about deeper benchmarking, it's here: [ https://github.com/ElSolem/
5. 5.▲
   by polymetron 1y ago

   For those interested in the deeper structure and test results (including performance benchmarks like 2,000 x 2,000 grids), I wrote a more detailed paper about the quantum algebraic pathfinding method: [PDF] Quantum Algebraic Pathfinding Pap
6. 6.▲
   Field-Based Pathfinding: A Quantum-Inspired Alternative to A*

   2 points by polymetron 1y ago|2 comments
7. 7.▲
   Show HN: AES-256 brute force using structured logic (UUIDs and xy = x/y rule)(github.com)

   11 points by polymetron 1y ago|0 comments