On Mon, Aug 24, 2009 at 9:47 PM,
<MorphemeAddict@wmconnect.com> wrote:
I agree that even at the rate at which I am imagining new gismu to be
created -- which may be ridiculously high -- there would be no actual
problem in this regard for millennia. However, even though I can write
a program to implementing the brute force algorithm that I have been
able to come up with to answer my second question -- What is the
_smallest_ number of gismu that could fill gismu space, starting
from an empty gismu space? -- the program would based on my initial
guess be O(n!); I don't expect that the program would finish in my
lifetime. The first question -- What is the _smallest_ number
of new gismu that could fill up gismu space? -- might not be
answerable except by the brute-force approach; but there has got to
be a better way to answer the second -- What is the _smallest_
number of gismu that could fill gismu space, starting from an empty
gismu space? -- I've just not thought of it. Consider that question
as a mathematical puzzle question with the rules for Lojban being the
set-up for the question; one doesn't have to consider what inspired
me to ask the question; I mentioned because I thought the notion of
what inspired me to ask that question would be interesting, _not_
because I thought that it had any real _practical_ applications --
Mathematicians look for higher and higher pairs of amicable numbers
(http://http://en.wikipedia.org/wiki/Amicable_numbers) but as far as
I know it is not for practical applications of them.
stevo