Type theoretic imperative and logic lang for mathematical programming.
Find a file
2025-07-06 21:42:09 +10:00
lang YALR (Yet Another Lexer Refactor) 2025-06-19 08:48:31 +10:00
py Typo fix + start of error handling 2025-07-06 21:42:09 +10:00
src Typo fix + start of error handling 2025-07-06 21:42:09 +10:00
tests begin shift to nim code base 2025-06-16 20:47:52 +10:00
.gitignore Added ultra simple build script for debug 2025-06-19 02:25:52 +10:00
noether.nimble Moved all lexer functionality to src/noether/lexer 2025-06-17 13:20:33 +10:00
README Added support for various nlTokTypes and added multiple demos 2025-06-17 13:08:21 +10:00

Noether is a project I plan to complete over a LONG period of time (years).
A collection of useful commands for solving various math problems.

A personal little MATLAB alternative I suppose :)


In future I'd love to start using a developed TUI library like [textual](https://github.com/Textualize/textual?tab=readme-ov-file),
but for now everything is just a custom ANSI wrapper thing.

Noether can compile to C or Nim via their respective backends.


NOTES:
1. could I define something like "primality classes"? 
	ie   class one: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, ...
	     class two: 3, 5, 11, 17, 31, ... (class 1 with a prime index, ie 11 is the 5th class 1 prime)
	   class three: 5, 11, 31, ... (class 2 with a prime index, ie 11 is the 3rd class 2 prime)

2. figure out all possible patterns that can appear amongst primitive roots
	can we then categorise primes by their primitive root behaviour?