Sujet : Re: Every sufficiently competent C programmer knows --- Semantic Property of Finite String
De : anw (at) *nospam* cuboid.co.uk (Andy Walker)
Groupes : comp.theoryDate : 16. Mar 2025, 15:28:55
Autres entêtes
Organisation : Not very much
Message-ID : <vr6n77$1krqv$1@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
User-Agent : Mozilla Thunderbird
On 15/03/2025 19:46, olcott wrote:
[I wrote, re the Goldbach Conjecture:]
Perhaps [just about] worth noting that a sufficiently long
[but not "infinite"] brute force attack on the GC [and many other
similar conjectures] would resolve the issue.
Not if GC is true and the proof cannot algorithmically
compressed into a finite sequence of steps.
You didn't read, or didn't understand, the rest of my article,
which explains that, indeed, only a finite number of steps is needed.
Read on before replying:
I always respond to the first mistake.
I did notice that you qualified this later on.
Perhaps you should have waited for the first mistake? I didn't
"qualify" my statement, rather I explained why a perhaps-surprising [at
first glance] claim is in fact correct. [I have no intention of having
a "'tis", "'tisn't" to-and-fro on this, so there is no need to reply,
and if you do, I shall ignore it.]
[... explanation snipped ...]
-- Andy Walker, Nottingham. Andy's music pages: www.cuboid.me.uk/andy/Music Composer of the day: www.cuboid.me.uk/andy/Music/Composers/Coleridge-Taylor