Term Rewriting
A model of computation that repeatedly replaces an expression matching a rule's left-hand side with its right-hand side. MeTTa evaluation is nondeterministic term rewriting over the AtomSpace.
A model of computation that repeatedly replaces an expression matching a rule's left-hand side with its right-hand side. MeTTa evaluation is nondeterministic term rewriting over the AtomSpace.