From owner-freebsd-chat@FreeBSD.ORG Wed Apr 28 10:13:10 2004 Return-Path: Delivered-To: freebsd-chat@freebsd.org Received: from mx1.FreeBSD.org (mx1.freebsd.org [216.136.204.125]) by hub.freebsd.org (Postfix) with ESMTP id F055216A4CE for ; Wed, 28 Apr 2004 10:13:10 -0700 (PDT) Received: from priv-edtnes40.telusplanet.net (outbound05.telus.net [199.185.220.224]) by mx1.FreeBSD.org (Postfix) with ESMTP id 906F943D5F for ; Wed, 28 Apr 2004 10:13:10 -0700 (PDT) (envelope-from cpressey@catseye.mine.nu) Received: from catseye.biscuit.boo ([154.5.85.228]) by priv-edtnes40.telusplanet.netSMTP <20040428171310.KRNB27488.priv-edtnes40.telusplanet.net@catseye.biscuit.boo> for ; Wed, 28 Apr 2004 11:13:10 -0600 Date: Wed, 28 Apr 2004 10:11:38 -0700 From: Chris Pressey To: chat@freebsd.org Message-Id: <20040428101138.38e25081.cpressey@catseye.mine.nu> In-Reply-To: <20040428163104.GA10537@Shark.localdomain> References: <20040425215837.3f4708fe.cpressey@catseye.mine.nu> <20040426094335.GA7578@online.fr> <20040426115842.GA4144@Shark.localdomain> <20040427160737.GA1325@Shark.localdomain> <20040428023920.GA382@Shark.localdomain> <20040428163104.GA10537@Shark.localdomain> Organization: Cat's Eye Technologies X-Mailer: Sylpheed version 0.9.10 (GTK+ 1.2.10; i386-portbld-freebsd4.9) Mime-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable Subject: Re: Beginning C++ in FreeBSD X-BeenThere: freebsd-chat@freebsd.org X-Mailman-Version: 2.1.1 Precedence: list List-Id: Non technical items related to the community List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 28 Apr 2004 17:13:11 -0000 On Wed, 28 Apr 2004 20:31:04 +0400 Sergey Zaharchenko wrote: > On Wed, Apr 28, 2004 at 04:30:10PM +0200, > Dag-Erling Sm=D0=ACrgrav probably wrote: > > Sergey Zaharchenko writes: > > > If the thesis sounds like > > > > > >> Any algorithm that can be written in one Turing-complete language > > >can> be written in another Turing-complete language. > > > > > > then I think I understand it. > >=20 > > No. A language is Turing-complete if it can be used to implement a > > universal Turing machine. What you quote is merely a consequence of > > Turing-completeness, not its definition. > >=20 >=20 > OK. >=20 > If I take out every word about main() from C's specification (making > it an ordinary function), will the resulting `language' stay > Turing-complete? Not AFAIK. > If not, why? You no longer have a start state. -Chris