Article View: comp.lang.prolog
Article #738Re: Help on problem needed!
From: Lars-Henrik Eriksson
Date: Thu, 27 Aug 1992 14:31
Date: Thu, 27 Aug 1992 14:31
16 lines
1529 bytes
1529 bytes
In article <meskes.714916931@ulysses>, meskes@ulysses (Michael Meskes) writes: >As far as I know Prolog is turing-complete and the proofs I know don't use >the Cut. So why isn't it possible to solve this problem im Prolog? That Prolog (or any language for that matter) is Turing complete just means that any algorithm can be coded in that language. It does not mean that it can express an arbitrary programming language construct. You ask for a way of expressing IF-THEN-ELSE. A construct such as IF a THEN b ELSE c is not an algorithm, so you cannot be certain that it can be expressed in Prolog. -- Lars-Henrik Eriksson Internet: lhe@sics.se Swedish Institute of Computer Science Phone (intn'l): +46 8 752 15 09 Box 1263 Telefon (nat'l): 08 - 752 15 09 S-164 28 KISTA, SWEDEN Fax: +46 8 751 72 30
Technical Details
Message-ID:
<1992Aug27.143108.22900@sics.se>Path:
arc1-ca.pugleaf.net!sparky!uunet!mcsun!sunic!sics.se!lheReferences:
<meskes.713709771@ulysses> <1992Aug25.074623.25450@greco-prog.fr> <14219@goanna.cs.rmit.oz.au> <meskes.714916931@ulysses>Show Full Headers
Complete Article Headers
Newsgroups: comp.lang.prolog Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!sunic!sics.se!lhe From: lhe@sics.se (Lars-Henrik Eriksson) Subject: Re: Help on problem needed! In-Reply-To: meskes@ulysses.informatik.rwth-aachen.de (Michael Meskes) Message-ID: <1992Aug27.143108.22900@sics.se> Keywords: help Sender: lhe@sics.se (Lars-Henrik Eriksson) Reply-To: lhe@sics.se (Lars-Henrik Eriksson) Organization: SICS, Kista (Stockholm), Sweden References: <meskes.713709771@ulysses> <1992Aug25.074623.25450@greco-prog.fr> <14219@goanna.cs.rmit.oz.au> <meskes.714916931@ulysses> Date: Thu, 27 Aug 1992 14:31:08 GMT Lines: 16