Hey,
> I think a traversal should in principal be performed with a query language
> that is not turing complete so we can guarantee termination.
Turning completeness is not the lower bound for non-guaranteed termination. You
can't guarantee completion in a regular language when your "String" (data
structure) is a graph. E.g.
a*
The only languages guaranteed to complete are Star-free languages. That is,
those that don't allow for recursion.
See ya,
Marko.
http://markorodriguez.com
_______________________________________________
Neo4j mailing list
[email protected]
https://lists.neo4j.org/mailman/listinfo/user
