Newsgroups: comp.theory, sci.logic
From: "H.J. Sander Bruggink" <sander.brugg...@uni-due.de>
Date: Wed, 16 May 2012 10:46:43 +0200
Local: Wed, May 16 2012 4:46 am
Subject: Re: The answer to the Halting Problem stored within Permutations of Internal States?
On 05/16/2012 12:49 AM, Peter Olcott wrote:
> On 5/15/2012 5:37 PM, Joshua Cranmer wrote:At any time during the Turing Machine's computation, this "infinite"
>> On 5/15/2012 4:51 PM, Peter Olcott wrote:
>>> On 5/14/2012 10:52 AM, Joshua Cranmer wrote:
>>>> If we accept the hypothesis that there is an infinite amount of
>>>> knowledge , then your Turing machine cannot exist, since a finite
>>>> number of states cannot store an infinite amount of memory.
>>> It can store it on the infinite tape.
tape only contains a finite amount of information.
>> You seriously believe that an amateur mathematician with at best aThey don't claim that the empty string has semantic meaning of itself,
>> Bachelor's in CS seriously knows more about "the mathematics of the
>> semantics of natural language" than the people who formalized
>> mathematics in the first place?
> Absolutely positively when these same people insist that the empty
they claim that NO STRING has semantic meaning of itself. You need some
kind of mapping from strings to meanings to understand the strings, and
this mapping may indeed attach a meaning to the empty string.
Just to show you what I mean, please answer the following questions:
Since it is completely obvious to everyone else that you are wrong, you
> You are still incorrect on this point. What is completely obvious to me
might condider the possibility that you actually are wrong.
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.