Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > sci.logic > #171558

Re: Infinitely Recursive input on HP Proofs

From Ben Bacarisse <ben.usenet@bsb.me.uk>
Newsgroups sci.logic, comp.theory
Subject Re: Infinitely Recursive input on HP Proofs
Followup-To sci.logic
Date 2018-02-01 02:13 +0000
Organization A noiseless patient Spider
Message-ID <87po5pa245.fsf@bsb.me.uk> (permalink)
References (14 earlier) <d0d89c98-f349-4111-8ead-596cd8ce6836@googlegroups.com> <87lgged8fq.fsf@bsb.me.uk> <PbSdnTmmwYlVw-zHnZ2dnUU7-LfNnZ2d@giganews.com> <87fu6lbsjp.fsf@bsb.me.uk> <9ZydnX1I3peQ8O_HnZ2dnUU7-fHNnZ2d@giganews.com>

Cross-posted to 2 groups.

Followups directed to: sci.logic

Show all headers | View raw


Pete Olcott <Pete@NoEmail.address> writes:

> On 1/31/2018 3:57 PM, Ben Bacarisse wrote:
>> Pete Olcott <Pete@NoEmail.address> writes:
>>
>>> On 1/30/2018 9:16 PM, Ben Bacarisse wrote:
>>>> peteolcott <peterolcott2@gmail.com> writes:
>>>>
>> <snip>
>>>>> If we create a machine specification that counts the characters
>>>>> of strings and a string of infinite length is provided as input
>>>>> we cannot expect this machine to halt on every input.
>>>>
>>>> That's wrong in so many ways.  No TM is ever provided with a string of
>>>> infinite length (a good book will tell you this).  A TM might construct
>>>> a string that never ends, but that's not the same thing.
>>>
>>> It is sufficiently analogous. If a TM is provided with a problem that
>>> specifies infinite recursion then a David Hilbert finite string
>>> formalization of this problem inherently requires infinite recursion.
>>>
>>> This is an analogous idea to a TM that counts the characters of a string
>>> and would otherwise halt except in the case where this string is (for
>>> all practical purpose) infinite.
>>
>> There is no "for all practical purposes" here.  TMs can not be provided
>> with infinite input.  The input is always finite.
>>
>> I don't know why you want to keep defending this minor mistake because
>> your argument incorrect though it is, does not depend on a TM being
>> given an infinite input string.
>>
>> We all know that some finite input strings can cause some TMs to loop
>> without end.
>>
>> <snip>
>>>>> H^ can only decide if w^ halts on it input w^2
>>>>> on the basis of w^2 halting on its input w^3...
>>>>
>>>> No.  From state qx on, H^ behaves like H' (which behaves like H until
>>>> the very last state).  The H (or the copy of H -- you decide which view
>>>> you take) which is embedded in H^ must simply do what it does with any
>>>> input it is asked to "decide".
>>>
>>> It lacks sufficient information to decide.
>>> H^ can only decide what w^ does on its input w^2 based on what w^ decides.
>>> The essence of this (like the Truth Teller Paradox) is infinitely recursive.
>>>
>>> If it is not infinitely recursive (and it is) then w^ would simply decide
>>> that w^2 halts on its NULL input. The H^ decides that this will cause w^
>>> to loop so it simply transitions to ((qn)).
>>
>> No.  I won't explain again because you are not listening.  Your words
>> have all sort of errors (H^ is not a decider so it does not decide
>> anything, w^ is a string so it can not loop, and so on) but I'm just
>> glossing over those -- you no longer care about details.
>>
>>>> You can't (and mustn't) say anything
>>>> about how it does that, but you *can* be sure that state qy or qn is
>>>> reached in a finite number of steps.  That's because, however it does
>>>> it, it is a decider.
>>>
>>> Making that assumption turns out to be exactly analogous to being certain
>>> that the Liar Paradox must be True or False.
>>
>> I don't care about your analogies -- mathematics requires stronger
>> arguments than "it's like this other thing".  Provided you accept that
>> the assumption must go we are in agreement.  As a result, I suspect you
>> will have to say you misspoke here.  Do you, in fact, agree that the
>> assumption made at the start of the proof must be wrong?
>>
>>>> The one thing that H^ can not do from state qx on is what you are
>>>> assuming it does, and that is to "run" (or emulate or evaluate) its
>>>
>>> It cannot run, it cannot emulate, in math terms evaluate is all that is left.
>>> All math expressions are evaluated, that is how math works.
>>
>> No, that is not how maths works, but going into that would derail the
>> whole thread.
>>
>> You are wrong in this specific case because your argument assumes
>> something it can not assume.  H^ *always* transitions from qx to either
>> qn or qy by the assumption made at the start of the proof.  
>
> That assumption provide itself to be false. Once an assumption is
> proven to be false that assumption no longer holds.

Exactly!!

Bells ring out over the land.  The people rejoice.  The long winter of
ignorance is over.

(You do know how a proof be contradiction works, yes?)

<snip>
>>>> You have a notation for this which you wrote out:
>>>>
>>>>     qx w^ w^ |-H^ qy oo
>>>>     qx w^ w^ |-H^ qn
>>>>
>>>> Do you know what that means?  If you do, why did you write it?  It is
>>>> correct and it contradicts what you are saying in words.
>>>
>>> http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/
>>> You left some key state transitions out:
>>
>> No.  You don't know what this notation means so you think the part I
>> left off matters.  I can't really help with that because I don't think
>> you want to learn about the notation.
>>
>>> Definition of Turing Machine Ĥ (state transition sequence)
>>> q0 ŵ ⊢* Ĥ qx ŵ ŵ ⊢* Ĥ qy ∞
>>> q0 ŵ ⊢* Ĥ qx ŵ ŵ ⊢* Ĥ qn
>>
>> This contradicts what you are saying in words, and it backs up (it is in
>> fact exactly) what I am saying with *my* words.  You clearly don't know
>> what this notation means or you would not keep writing something that
>> contradicts yourself again and again.
>
> You know that is a lie. Quit lying.

No you appear not to know what the notation you are using means.  If you
did know you would write what you are claiming using that notation, but
instead you keep writing what I am saying.

It would be very much better if you would stop calling things you
disagree with lies.  Even convinced as you are that you know what that
notation means, there is no reason to suppose that I am lying about what
I think it means.

> H^ must examine what w^ does
> this requires an examination of what w^2 does
> which requires an examination of what w^3 does...

That is not what the notation says.  The notation says what I keep
telling you.  It's not ambiguous.  There is no room for
misunderstanding.  The |- with the * and the machine name are all quite
clear.  You keep saying (in symbols) that H^ always transitions from
state qx to either state qy or state qn in a finite number of steps.
Then you keep denying that in words despite saying it in symbols again
and again.

> otherwise w^2 would simply transition to ((qn)) based on NULL input
> which would cause w^ to transition to (qy)
> which would cause H^ to transition to ((qn))
>
> Thus H^ would correctly decide halting for w^ w^2.
>
> In either case the HP proof counter-example fails to be a
> counter-example.

There is no counter-example.  This is a proof by contradiction and you
have agreed above that the assumption being posited for rejection must
indeed be rejected.  (You have an invalid argument for that rejection,
but I am not going to quibble about that -- we both appear to agree now
that assuming that H is a halt decider leads to a contradiction.)

>> I've said this before, but I think you should stick to words.  It's a
>> shame, because they can be so very ambiguous, but you don't seem to have
>> the right mentality for formal notations.  Lots of the formulas you
>> write are either under-specified (and thus have a sort of vague poetic
>> quality) or are well-defined and say something you don't mean.
>>
>> I repeat: those two lines are correct and they say what I am saying not
>> what you are trying to say.
>
> No you have simply not devoted a single-minded focus sufficiently to
> see that this is not the case.

An educated reader can work out what the notation says in a few minutes.
You keep writing two lines that say exactly what you are trying to deny.
However long you have not spent on it you have not spent enough time to
understand the symbol you are throwing about.  It will vary from person
to person how many hours are needed, but since it's not a complicated
notation it might be worth your tying.

Or would could keep writing out what I am saying in symbols whilst
denying it in words.  That looks bonkers to educated onlookers, but it
suits me down to the ground.

-- 
Ben.

Back to sci.logic | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread


Thread

Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-25 20:26 -0800
  Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-25 21:49 -0800
    Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-26 04:10 -0800
      Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-26 11:37 -0600
        Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-26 15:12 -0800
    Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-26 05:34 -0800
      Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-26 20:33 -0800
        Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-27 05:05 -0800
          Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-27 06:57 -0800
            Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-27 13:53 -0800
        Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-27 20:24 +0000
          Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-27 13:03 -0800
            Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-27 21:58 +0000
              Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-29 19:02 -0800
                Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-29 20:11 -0800
                Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-30 08:49 -0800
                Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-30 09:43 -0800
                Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-30 17:07 -0800
                Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-30 17:41 -0800
                Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-30 18:40 -0800
                Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-30 19:17 -0800
                Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-31 00:20 -0600
                Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-30 21:21 -0800
                Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-29 21:21 -0800
                Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-30 08:58 -0800
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-31 03:16 +0000
                Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-31 00:14 -0600
                Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-30 22:37 -0800
                Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-31 10:53 -0600
                Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-31 19:38 -0800
                Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-01 19:42 -0600
                Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-01 18:08 -0800
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-31 21:57 +0000
                Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-31 16:21 -0600
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-01 01:44 +0000
                Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-01 19:11 -0600
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-02 01:54 +0000
                Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-01 21:15 -0600
                Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-01 19:36 -0800
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-02 21:13 +0000
                Re: Infinitely Recursive input on HP Proofs Peter Percival <peterxpercival@hotmail.com> - 2018-02-02 21:30 +0000
                Re: Infinitely Recursive input on HP Proofs Andy Walker <anw@cuboid.co.uk> - 2018-02-03 18:17 +0000
                Re: Infinitely Recursive input on HP Proofs Andy Walker <anw@cuboid.co.uk> - 2018-02-03 18:42 +0000
                Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-03 12:46 -0800
                Re: Infinitely Recursive input on HP Proofs "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-02-03 20:53 -0600
                Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-03 19:51 -0800
                Re: Infinitely Recursive input on HP Proofs "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-02-05 18:56 -0600
                Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-05 17:22 -0800
                Re: Infinitely Recursive input on HP Proofs "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-02-05 20:45 -0600
                Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-05 21:45 -0800
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-06 15:34 +0000
                Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-06 08:02 -0800
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 01:51 +0000
                Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-06 10:23 -0800
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 01:52 +0000
                Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-06 17:19 -0800
                Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-06 17:59 -0800
                Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-06 19:02 -0800
                Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-07 20:57 -0800
                Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-06 22:39 -0800
                Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-06 23:14 -0800
                Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-08 03:45 -0800
                Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-06 22:28 -0800
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 03:31 +0000
                Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-06 17:54 -0800
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 02:13 +0000
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 03:49 +0000
                Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-06 22:48 -0600
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 16:27 +0000
                Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-07 23:22 -0600
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-08 21:05 +0000
                Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-08 18:44 -0600
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-09 11:08 +0000
                Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-11 08:44 -0800
                Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-11 08:47 -0800
                Re: Infinitely Recursive input on HP Proofs Peter Percival <peterxpercival@hotmail.com> - 2018-02-11 17:55 +0000
                Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-12 20:39 -0600
                Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-08 03:41 -0800
                Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-08 03:43 -0800
                Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-06 18:56 -0800
                Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-07 20:50 -0800
                Re: Infinitely Recursive input on HP Proofs "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-02-06 20:13 -0600
                Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-05 17:45 -0800
                Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-04 17:01 -0800
                Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-05 16:44 -0800
                Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-05 17:42 -0800
                Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-05 18:09 -0800
                Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-05 21:50 -0800
                Re: Infinitely Recursive input on HP Proofs "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-31 19:57 -0600
                Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-01 11:02 -0800
                Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-31 19:10 -0600
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-01 01:51 +0000
                Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-01 19:24 -0600
                Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-01 17:34 -0800
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-02 02:04 +0000
                Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-01 21:31 -0600
                Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-01 19:43 -0800
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-02 21:38 +0000
                Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-02 17:54 -0600
                Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-02 16:08 -0800
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-03 00:51 +0000
                Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-03 00:38 -0600
                Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-02 23:05 -0800
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-03 13:37 +0000
                Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-03 14:27 -0600
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-03 23:49 +0000
                Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-03 16:03 -0800
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-04 00:44 +0000
                Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-03 17:11 -0800
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-04 01:27 +0000
                Re: Infinitely Recursive input on HP Proofs Newberry <newberryxy@gmail.com> - 2018-02-03 18:01 -0800
                Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-03 20:44 -0800
                Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-04 02:32 -0800
                Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-03 16:47 -0800
                Re: Infinitely Recursive input on HP Proofs Peter Percival <peterxpercival@hotmail.com> - 2018-02-02 14:12 +0000
                Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-31 19:27 -0600
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-01 02:13 +0000
        Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-03 17:00 -0800

csiph-web