We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.
You must be logged in to block users.
Contact GitHub support about this user’s behavior. Learn more about reporting abuse.
Implementation of the algorithm described in Computer solution to the 17-point Erdős-Szekeres problem
Rust
Implementation of "Generating Candidate Busy Beaver Machines (Or How to Build the Zany Zoo)" (https://arxiv.org/abs/1610.03184)
Lua
-- Computer search to prove the nonexistence of minimal time solutions
-- to the FSSP with 4-(non-boundary)states.
-- States *,g,s,f,h... are represented by 0,1,2,3,4... respectively.
-- Hosted at: https://gist.github.com/Average-user/4241ca84777ae6ed38326710d8b47da4
Implementation of the Hydra Game described in the paper Accessible independence results for Peano Arithmetic by L. Kirby and J. Paris.
Haskell
Software to practice Go
Clojure 12 1
Implementation of Fruchterman-Reingold algorithm for directed force Graph Drawing
Clojure 1 1
There was an error while loading. Please reload this page.