just 5 quick answers then I can summarise and GO
From: |-|erc (h_at_r.c)
Date: 01/10/05
- Next message: Lee Rudolph: "Re: There are uncountably many irrationals"
- Previous message: Mike Turco: "Re: Questions about math tutoring"
- Next in thread: John Savard: "Re: just 5 quick answers then I can summarise and GO"
- Reply: John Savard: "Re: just 5 quick answers then I can summarise and GO"
- Reply: Termite of Tempation: "Re: just 5 quick answers then I can summarise and GO"
- Reply: David Bernier: "Re: just 5 quick answers then I can summarise and GO"
- Reply: Will Twentyman: "Re: just 5 quick answers then I can summarise and GO"
- Messages sorted by: [ date ] [ thread ]
Date: Tue, 11 Jan 2005 03:12:08 +1000
A)
SEQUENCE = <314159265..........................................................................>>
<--- HOW MANY DIGITS???--->
(B)
COMPUTABLES
1 <398498498.................>
2 <484849848.................>
3 <383873838.................>
..
How many digits of (A) appear in correct sequence in (B), guaranteed?
1 _______
===================================================
(A)
RANDOM SEQUENCE = <654445676764545..............................................................>
<--- HOW MANY DIGITS???--->
(B)
COMPUTABLES UTM(row, col) mod 10
1 <398498498.................>
2 <484849848.................>
3 <653873838.................>
..
How many digits of (A) appear in correct sequence in (B), guaranteed?
(Randomness could be introduced from outside the computer).
2 __________
===================================================
So given a coin sequence <HTHHHTTHTTHTHTHTHHHTH.......................>
How many flips (at least) of cs appear on the computable number list in order?
CNL = UTM(row, col) mod 2
<0010101010100101..>
<1010110110101001..>
<0000000000000000..>
<1111111111000000..>
<1010101010101010..>
..
3 __________
==================================================
> >> all coin sequences are computable to infinite length ?
>
> false
4 = "all coin sequences to infinite length appear (all flips in order) in any UTM computable list."
4 <-> _________
=======================================================
>
> >What about this one, any Cantorians want to assign it T or F?
>
> >"There is a maximum to the number of coins in any given oo coin sequence, that can be computed"
>
> false too
What is the opposite as a true proposition?
5 ___________________________________________
========================================================
-- I am The Truman of Jim Carrey fame. Please help stop me being tortured since April 2002 with constant microwave laser from the Truman satelite splitting my head and tormenting me and people around me. Not a prank, I am not crazy, The Truman Show made you think that ---------------------------------------------s-o-s-----------------------------------------
- Next message: Lee Rudolph: "Re: There are uncountably many irrationals"
- Previous message: Mike Turco: "Re: Questions about math tutoring"
- Next in thread: John Savard: "Re: just 5 quick answers then I can summarise and GO"
- Reply: John Savard: "Re: just 5 quick answers then I can summarise and GO"
- Reply: Termite of Tempation: "Re: just 5 quick answers then I can summarise and GO"
- Reply: David Bernier: "Re: just 5 quick answers then I can summarise and GO"
- Reply: Will Twentyman: "Re: just 5 quick answers then I can summarise and GO"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|