SuiteSparse
collatz
| SuiteSparse | collatz | |
|---|---|---|
| 4 | 2 | |
| 1,068 | 56 | |
| - | - | |
| 9.9 | 8.0 | |
| 5 days ago | about 2 months ago | |
| C | Shell | |
| GNU General Public License v3.0 or later | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
SuiteSparse
-
Copilot under fire as dev claims it emits 'large chunks of my copyrighted code'
https://github.com/DrTimothyAldenDavis/SuiteSparse/blob/mast... it's lgpl or gpl, which is the point of the complaint.
GitHub does a ton of work to formalize license management, it's odd that copilot ignored all of that.
-
GitHub Copilot, with “public code” blocked, emits my copyrighted code
It is also allowed to be used under LGPL terms: https://github.com/DrTimothyAldenDavis/SuiteSparse/blob/mast...
But that doesn't make it any better.
-
Why is this call to free producing a segfault?
I am trying to use some files from a library on GitHub in my program, but I am getting the error:
collatz
-
I have to brag to you: I gained computing resources on the third most powerful supercomputer in the world. The computing resources will be used for the computational verification of the Collatz problem.
The OP is aware of shortcuts. Read here: https://github.com/xbarin02/collatz/blob/master/doc/ALGORITHM.md OP is confirming that iterating on each starting integer (greater than 1) results in an integer less than the starting value. OP is using sieves to greatly reduce the fraction of starting values that need to be checked. OP is using a shortcut to increase speed: k2p-1 -> k3p-1 and a precomputed powers of 3 lookup table. There are theoretically better shortcuts but they may be slower in practice since they require large lookup tables that lead to cache misses which will slow things down.
-
Collatz Conjecture Verified till 2^69
LINKS: You can track the progress here: collatz-problem.org You can check the path records here: collatz-problem.org/table You can check the source code here: https://github.com/xbarin02/collatz You can read the original paper here: https://rdcu.be/b5nn1
What are some alternatives?
collatz_finder - Tries to find a counterexample to the Collatz Conjecture, in Rust
matio - MATLAB MAT File I/O Library
arb - Arb has been merged into FLINT -- use https://github.com/flintlib/flint/ instead
PrimeNumbers-C-code - Function that take a N number and return TRUE if it is prime or FALSE if not.
C - Collection of various algorithms in mathematics, machine learning, computer science, physics, etc implemented in C for educational purposes.
MooseFS - MooseFS – Open Source, Petabyte, Fault-Tolerant, Highly Performing, Scalable Network Distributed File System (Software-Defined Storage)
Code-Finds-Determinant-of-a-Array-in-C
Collatz-finder.js - Website that tries to find a counterexample to the Collatz Conjecture
julia - Simple fractal drawing software
cleargrasp - Official repository for the paper "ClearGrasp: 3D Shape Estimation of Transparent Objects for Manipulation"