Graph Field Automata · HackerPapers discussions

Graph Field Automata — HN submission

Sat, 10 Jan 2009 22:04:32 GMT

Toward a new mathematical theory of computation.

Here is an outline of a new lisp I plan on creating. I am deconstructing lisp and finding what is really meant in lisp and reconstructing it utilizing category theory and logical programming. By reconstructing I mean actually taking axioms of lisp and retooling them into logic and category theories. Lisp becomes something different and instead a subset of the language. Lisp will be fully expressable as a turing complete language but there will be other paradigms in the language. Functional programming is still a part of lisp. We also add monads to represent computation. Category theory is…

5 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Graph Field Automata — HN submission

Mon, 05 Jan 2009 13:22:07 GMT

Ask HN: Please review my new computer architecture I plan to sell as PaaS.

I plan on selling compute time on this architecture at about $0.75 cents more on an EC2 instance. The advantages to this architecture are. - Easy nonlinear operation [it is a nondeterministic automaton} - Theoretical Solution of intractable computing problems [All of NP probably some of P# etc...] - Ease of implementation and licensing [it is a piece of software] - Ease of distributing over network or concurrency (the software has immutable data structures in matricies which can be implemented across multiple computers using map/reduce over a distributed hash table.) The computer architecture…

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.