Re: Can the 'Turing Problem' be deflated?
- From: J Jones <jonescardiff@xxxxxxx>
- Date: Mon, 31 Mar 2008 21:45:05 +0100
george wrote:
On Mar 31, 2:24 pm, J Jones <jonescard...@xxxxxxx> wrote:(e.g., when we do not know whether the
machine will halt or not)
What "we" do or don't "know" has ABSOLUTELY
NOTHING TO DO WITH ANYTHING. You really
should confine yourself to talking about what YOU
don't know. The fact that John Jones does not know
a fact DOES NOT IN ANY WAY IMPACT the truth
(or factuality) of the fact, if it is a fact about TMs.
Conditioning ANYthing in THIS realm upon what some
human does or does not know IS JUST STUPID.
I don't want to make claims about the TM problem that appear to depend on factors lying outside the domain of the problem. So, I will pare down my observations to the bare minimum. This provides us with the kernel of the plot:
"The TM either halts or does not engage in computation."
That should suffice. The statement is analytic - its proof is self-evident.
.
- Follow-Ups:
- Re: Can the 'Turing Problem' be deflated?
- From: Jesse F. Hughes
- Re: Can the 'Turing Problem' be deflated?
- References:
- Can the 'Turing Problem' be deflated?
- From: John Jones
- Re: Can the 'Turing Problem' be deflated?
- From: Marshall
- Re: Can the 'Turing Problem' be deflated?
- From: J Jones
- Re: Can the 'Turing Problem' be deflated?
- From: george
- Can the 'Turing Problem' be deflated?
- Prev by Date: Re: Size Theory.
- Next by Date: Re: Can the 'Turing Problem' be deflated?
- Previous by thread: Re: Can the 'Turing Problem' be deflated?
- Next by thread: Re: Can the 'Turing Problem' be deflated?
- Index(es):