Russ Abbott wrote:
> This is about white being to the left of green, but I have to work up to it.
> (Since I not yet sure I know how to think about Oz's search protocols,
> perhaps the following is nonsense.)
> An hour ago (we have a Saturday class), I was explaining the palindrome
> project to my class as an introduction to Oz as a logic programming system.
> A piece of the code is
>
> N1 = 10*{Digit} + {Digit}
> N2 = 10*{Digit} + {Digit}
> X = N1 * N2
>
> where {Digit} generates all of the digits using choice. (This is from CTM
> chapter 9.) I said that the way to think about what's going on is that these
> two lines generate 10,000 threads, some of which get killed off later when X
> is found not to be a 4-digit palindrome. The ones that succeed produce
> results that are gathered together by SearchAll.
> (In Prolog one would talk about backtracking. I gather that in Oz one
> imagines them all running at once. Is that reasonable?)
Not really. When used in a search, this potentially creates up to 10000
*spaces*, but a space is not the same thing as a thread. How a search engine
uses threads is specific to each search engine.
--
David Hopwood <[EMAIL PROTECTED]>
_________________________________________________________________________________
mozart-users mailing list
[email protected]
http://www.mozart-oz.org/mailman/listinfo/mozart-users
