10 algorithms for long arithmetic
The coin problem (Frobenius problem) is a mathematical problem that asks what is the largest monetary amount that cannot be obtained using only coins of specified denominations.
Paraconsistent computation layer: Lean 4 formalization of the Imscribing Grammar with Belnap FOUR logic
A 12-primitive measurement apparatus for the structural type of any system — 17,280,000-address Crystal of Types
A web-application with tools for generating pseudorandom binary sequences, performing analysis, and visualizing results with graphs and charts.
Calculators for basic needs for solving problems related to matrices and graphs
A self-verifying agentic loop harness: THINK→ACT→OBSERVE→UPDATE with Frobenius-closed tool calls
This notebook features Mathematica functions for working with and visualizing C-semigroups in N², using the Normaliz package. Normaliz is an open-source tool for computations in affine monoids, lattice polytopes, and rational cones (https://www.normaliz.uni-osnabrueck.de/).
⊙MonadOS: the Imscribing Grammar as an operating kernel — Frobenius loop executing as an OS (Python)
Algebraic, exact, deterministic paraconsistent bio-organic chemistries — protein design, gene pipeline, materials science
Add a description, image, and links to the frobenius topic page so that developers can more easily learn about it.
To associate your repository with the frobenius topic, visit your repo's landing page and select "manage topics."