HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.
Abstract
The Graph Automata have been the paradigm in the expression of utilizing Graphs as a language. Matrix Graph grammars \cite{Pedro} are an algebratization of graph rewriting systems. Here we present the dual of this formalizm which some extensions which we term Graph Field Automata The advantage to this approach is a framework for expressing machines that can use Matrix Graph Grammars.
arXiv comments
totally wrong doesn't make any sense would like to widthdraw
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…
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…
Also discussed alongside
Connected through shared HN threads, not inferred similarity or a recommendation.