From owner-freebsd-chat@FreeBSD.ORG Wed Apr 28 07:30:28 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 571FA16A4CE for ; Wed, 28 Apr 2004 07:30:28 -0700 (PDT) Received: from smtp.des.no (flood.des.no [217.116.83.31]) by mx1.FreeBSD.org (Postfix) with ESMTP id B177E43D5C for ; Wed, 28 Apr 2004 07:30:27 -0700 (PDT) (envelope-from des@des.no) Received: by smtp.des.no (Pony Express, from userid 666) id DEAC9530D; Wed, 28 Apr 2004 16:30:25 +0200 (CEST) Received: from dwp.des.no (des.no [80.203.228.37]) by smtp.des.no (Pony Express) with ESMTP id 1FC47530C; Wed, 28 Apr 2004 16:30:11 +0200 (CEST) Received: by dwp.des.no (Postfix, from userid 2602) id F37BB33C71; Wed, 28 Apr 2004 16:30:10 +0200 (CEST) To: Sergey Zaharchenko References: <20040425215837.3f4708fe.cpressey@catseye.mine.nu> <20040426094335.GA7578@online.fr> <20040426115842.GA4144@Shark.localdomain> <20040427160737.GA1325@Shark.localdomain> <20040428023920.GA382@Shark.localdomain> From: des@des.no (=?iso-8859-1?q?Dag-Erling_Sm=F8rgrav?=) Date: Wed, 28 Apr 2004 16:30:10 +0200 In-Reply-To: <20040428023920.GA382@Shark.localdomain> (Sergey Zaharchenko's message of "Wed, 28 Apr 2004 06:39:20 +0400") Message-ID: User-Agent: Gnus/5.1006 (Gnus v5.10.6) Emacs/21.3 (berkeley-unix) MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: quoted-printable X-Spam-Checker-Version: SpamAssassin 2.63 (2004-01-11) on flood.des.no X-Spam-Level: X-Spam-Status: No, hits=0.0 required=5.0 tests=AWL autolearn=no version=2.63 cc: Rahul Siddharthan cc: Chris Pressey cc: chat@freebsd.org 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 14:30:28 -0000 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. 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. > In the functional way (`what it can do') C is not different from C++, as > you all are pointing out (so I'm not trying to persuade you Turing was > wrong). It's different in what it allows you to inform the system (the > linker, for instance) about (and it will learn that *before* any actual > algorithm of yours is executed). The operating system, the C++ compiler and the linker are all written in C, and using C, you can write an emulator for the computer, on which the OS, C++ compiler and linker will behave exactly as you expect. DES --=20 Dag-Erling Sm=F8rgrav - des@des.no