In sci.math Daniel Pitts <
newsgrou...@virtualinfinity.net> wrote:
> [...] Hence my suggestion that the interesting problem is
> "using the fewest turns, how do you get 'n' minutes".
Not obvious that complexity theory (or accumulated error)
thrown into the "hourglass instruction set" really adds
anything of abstract interest. But it did originally seem
to me like the "language" might have interesting semantics
until someone pointed out you could measure four minutes
and then every minute after (and including) seven, with
just the 4- and 7-minute timers. So the "computable set"
of times is pretty trivial, being N\{1,2,3,5,6}.
Is there any way to make it more interesting?
For example, suppose you're only allowed to reset the timer
after it runs out. Does that make the computable times
more interesting? Is there any way to make it more interesting?
If so, then a question about the "algebra" occurred to me,
as follows. Suppose you have a set S1={k1,t1, k2,t2, ..., kn,tn}
meaning k1 hourglasses that time t1, ..., through kn that time tn.
And suppose that allows you to "compute" times T1={some set of times}.
Then T1 is the "semantics" of S1. And suppose you also have an
S2,T2. How do they (algebraically) combine? That is,
what's the T for S1\/S2 (the set-theoretic "or"), and
what's the T for S1/\S2 (the set-theoretic "and") of the S's?
And how do these T's relate to T1 and T2.
Of course, you first need an instruction set that
gives rise to non-trivial T's (subsets of N) in the first place,
if that's possible. If not, is there some kind of
instruction set that does? I'd imagine so, but couldn't
figure out what to google.
--
John Forkosh ( mailto:
j...@f.com where j=john and f=forkosh )