Re: Fishing for a problem
- From: Nick Wedd <nick@xxxxxxxxxxxxx>
- Date: Fri, 31 Mar 2006 10:45:46 +0100
In message <jV2Xf.7160$4L1.1544@xxxxxxxxxxxxxxxxxxxxxxxxxx>, student <nospam@xxxxxxxxxxx> writes
Hello.
I am fishing for a problem that requires
as a necessary (or at least intuitively natural)
part of its solution the task of unifying
very large potentially infinite trees that have
a common recursive definition.
This fulfils your specification, and is relevant to Prolog:
find a value for X such that
X =.. X.
succeeds.
Nick
Is this a reasonable request?
I suspect that I have not well-defined the problem,
but have I said enough to get in "onto the playing field",
so to speak?
If so, does it have an established name, like "The Knapsack Problem"?
If not, would anyone care to suggest a way in which such a problem
might arise "in the real world"?
Thank you.
--
--
Nick Wedd nick@xxxxxxxxxxxxx
.
- References:
- Fishing for a problem
- From: student
- Fishing for a problem
- Prev by Date: Re: Fishing for a problem
- Next by Date: AFC bug fixation
- Previous by thread: Re: Fishing for a problem
- Next by thread: AFC bug fixation
- Index(es):
Relevant Pages
|
|
