----- Original Message ----
> From: Marko Rodriguez <[email protected]>
> To: Neo4j user discussions <[email protected]>
> Sent: Mon, July 26, 2010 2:51:41 PM
> Subject: Re: [Neo4j] Problem-Solving with Graph Traversals (Presentation)
>
> Hello,
>
> > The slides would be clearer for me if each expression was paraphrased in
>English
>
> > (e.g. i ∈ V - i is a member of the set V), and I think it'd help other
> > graph
>
> > theory newbies too.
>
> Computer programming has a direct mapping to mathematical notation. For
>example:
>
> > i ∈ V
>
> is equivalent to:
>
> % set up
> V = new HashSet();
> V.add(i);
> % equivalence
> assertTrue(V.contains(i))
>
> What I could do is write a short article entitled, something along the lines
>of, "The Symbols, Syntax, and Semantics of Mathematics and Computation." At
>which point, I can establish the mapping between mathematical notation and
>programming statements.
>
> Thoughts?,
I think that'd be really helpful. Thanks.
> Marko.
>
> http://markorodriguez.com
>
> _______________________________________________
> Neo4j mailing list
> [email protected]
> https://lists.neo4j.org/mailman/listinfo/user
>
_______________________________________________
Neo4j mailing list
[email protected]
https://lists.neo4j.org/mailman/listinfo/user
