Deutsch English Français Italiano |
<v6l2sg$deia$1@solani.org> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!news.mixmin.net!weretis.net!feeder8.news.weretis.net!reader5.news.weretis.net!news.solani.org!.POSTED!not-for-mail From: Mild Shock <janburse@fastmail.fm> Newsgroups: sci.logic Subject: PROLOG AND INFINITE TREES (Was: --- OLCOTT BANNED ---) Date: Wed, 10 Jul 2024 06:32:15 +0200 Message-ID: <v6l2sg$deia$1@solani.org> References: <v6iufa$cd7u$4@solani.org> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Wed, 10 Jul 2024 04:32:17 -0000 (UTC) Injection-Info: solani.org; logging-data="440906"; mail-complaints-to="abuse@news.solani.org" User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101 Firefox/91.0 SeaMonkey/2.53.18.2 Cancel-Lock: sha1:EqfTZ/jztZ2oBmPrwm93vUdSDJo= In-Reply-To: <v6iufa$cd7u$4@solani.org> X-User-ID: eJwNyckRACAIBMGU5FowHEDJPwT9TfWYgNCuMKiNTRl83U0y57Ak5Nfi0gzSwP5wg7Oi/wEPpzvrmjqZTt35ADv0FUw= Bytes: 2011 Lines: 34 Hi, Pete Olcott is full of bullshit. He writes nonsense like for example: "According to the formal definition of Unification, this kind of “infinite term” should never come to exist" https://philarchive.org/archive/OLCPDPv4 Thats not true. There are different formal definitions of Unification. There is Unification with and without occurs check. There are algorithms that can make Unification without occurs check terminate, and such an algorithm is for example implemented in SWI-Prolog. They were pioneered by Alain Colmerauer himself, the co-inventor of Prolog, who even wrote a paper about the subject: PROLOG AND INFINITE TREES Alain Colmerauer - 1982 Universite Aix-Marseille https://www.softwarepreservation.org/projects/prolog/marseille/doc/Colmerauer-InfTree-1982.pdf Bye Mild Shock schrieb: > > The full time idiot olcott should be > put in jail, and the key should be thrown away. > All he can do is spam other peoples threads > with his crazy lovebird chirping.