Re: Review of Mueckenheims book.

On Mar 17, 4:57 pm, mueck...@xxxxxxxxxxxxxxxxx wrote:
On 17 Mrz., 20:27, "William Hughes" <wpihug...@xxxxxxxxxxx> wrote:



On Mar 17, 2:16 pm, mueck...@xxxxxxxxxxxxxxxxx wrote:

On 17 Mrz., 16:12, "William Hughes" <wpihug...@xxxxxxxxxxx> wrote:

On Mar 17, 9:18 am, mueck...@xxxxxxxxxxxxxxxxx wrote:

How about

4.1 Each element of P_I corresponds to an endless sequence of
elements of P_F

<snip>

[No, I will not agree to that]

How about

4.2 Each element of P_I corresponds to a sequence of
elements of P_F


<snip>

[No, I will not agree to that]

Ok, right back to basics. How about

7. The infinite tree T(oo), is the union of all
finite trees, U(T(n)).

8. An element of P_I is a path in T(oo)

- William Hughes

.

Relevant Pages

  • Re: Hello and *++* ?
    ... Ah, a terminology dispute. ... I was thinking of the BASICs of our youth. ... It was my first programming language, ...
    (comp.lang.c)
  • Re: For Your Amusement
    ... Whilesome professors are ... - historically BASICs have been the language that people who have a ... VB.NET is not filling that gap ...
    (microsoft.public.vb.general.discussion)
  • Re: As the Crow flies.
    ... Because you can't comprehend the basics. ... If your code is faster than mine, and can be shown to execute in ...
    (talk.origins)
  • [OT] BASIC and GC (was: Why isnt multiple inheritance very useful?)
    ... >> reference counting would be the more efficient option) ... Or is that a typo for "Reference counting isn't an alternative to ... But now that some BASICs have dynamic arrays and even partial ...
    (comp.lang.cpp)
  • Re: For Your Amusement
    ... >- historically BASICs have been the language that people who have a ... the language for analysts who want to write their own code ... >VB.NET is not filling that gap ...
    (microsoft.public.vb.general.discussion)
Loading