W3C home > Mailing lists > Public > w3c-rdfcore-wg@w3.org > October 2001

Re: A strange question

From: <jos.deroo.jd@belgium.agfa.com>
Date: Thu, 25 Oct 2001 19:23:17 +0100
To: phayes@ai.uwf.edu
Cc: w3c-rdfcore-wg@w3.org
Message-Id: <OF709D20B8.24AD4704-ON41256AF0.00646B8E@bayer-ag.com>

[...]
> OK, how about this:
>
> ====etc002.n3
> []etc:supportsProofOf
> [etc:blunt <etc002.n3>;
> etc:kind <rdf-rules.n3>;
> etc:sharp <etc002.n3>] .
> ====
>
> ? My guess is it ought to either immediately succeed, or else recurse
> forever, depending on which way your code has its main loop nested :-)

it recurses, but not forever...
i.e. I guess till after some resources are exhausted
(so it comes back after 8 seconds on my PC here
and without proof)
I will think about an Euler path for that

--
Jos
Received on Thursday, 25 October 2001 13:23:24 EDT

This archive was generated by hypermail pre-2.1.9 : Wednesday, 3 September 2003 09:41:13 EDT