Title: collatz conjecture graph in processing Post by: ker2x on March 16, 2010, 01:16:44 AM i wrote a small app that graph the tree graph of the collatz conjecture.
the source code is available, but it's very ugly and memory inefficient. it need a full rewrite, but it's a few hour of hack :) here it is : http://ker.endofinternet.net/img/collatz/ Title: Re: collatz conjecture graph in processing Post by: Timeroot on March 16, 2010, 05:54:45 AM This wouldn't by any chance be related to xkcd, would it?
Hmmmmm? :D Title: Re: collatz conjecture graph in processing Post by: ker2x on March 16, 2010, 09:53:29 AM you mean http://xkcd.com/710/ ?
it's 2000% related ;D Title: Re: collatz conjecture graph in processing Post by: jehovajah on March 16, 2010, 11:13:57 AM As simple as this rule is the graph demonstrates short term and long term memory structure with local revision of learrning. It may be a basis for artificial learning in memory structures.
Title: Re: collatz conjecture graph in processing Post by: kram1032 on March 16, 2010, 02:54:24 PM cool app :D
Very rigid xD Title: Re: collatz conjecture graph in processing Post by: ker2x on March 19, 2010, 11:46:50 AM i rebuilt the same kind of program, using neo4j : http://github.com/ker2x/Collatz4Neo
i processed tens of milliions of node. now trying with hundreds of millions of node. The probleme is : how to visualize a graph with millions of node ? :'( Obviously, my processing app can't draw that kind of huge graph :sad1: about neo4j, it's a graph database that can be jound here : http://www.neo4j.org/ Title: Re: collatz conjecture graph in processing Post by: jehovajah on October 08, 2010, 10:31:20 AM Thanks for the references. Very interesting tensor! |