Slalom tree computing – a tree computing theory for artificial intelligence

Abstract

A basis for a parallel tree computing theory with intelligent languages and intelligent algebraic tree rewriting is presented. We present intelligent syntax and put forth slalom tree rewriting. The formulation leads to theoretical results that provide the basis for parallel algebraic tree rewrite computing with intelligent trees. Tree completion theorems are presented, and techniques for generating initial intelligent models for slalom computing are developed. We also have soundness and completeness theorems for slalom tree computing logic and its preliminary model theory, and theorems relating Reason Slalom to slalom tree computing.