Re: identifying entities across database updates

From: Bob Badour <bbadour_at_pei.sympatico.ca>
Date: Tue, 14 Jul 2009 20:38:24 -0300
Message-ID: <4a5d15fb$0$23752$9a566e8b_at_news.aliant.net>


Gene Wirchenko wrote:

> Tegiri Nenashi <TegiriNenashi_at_gmail.com> wrote:
>

>>On Jul 14, 2:26 pm, Gene Wirchenko <ge..._at_ocis.net> wrote:
>>
>>>     I am studying computation theory right now.  The most complex
>>>that I have seen so far is 5-tuples.  It is nice to see it all defined
>>>explicitly.
>>
>>7-tuple:
>>
>>http://en.wikipedia.org/wiki/Turing_machine#Formal_definition

>
> I can not see why the input alphabet would be any different from
> the tape alphabet. Explicitly naming blank is the sixth.
>
>
>>It is remarkable that among different models of computations the
>>ugliest one won.

>
> Not really. At this level, the simplest set of axioms wins. The
> ugliness is called elegance. One builds on top of the simple to get
> the pretty stuff.
>
> [snip]

Nah. Turing machines are fugly. Received on Wed Jul 15 2009 - 01:38:24 CEST

Original text of this message