POV-Ray : Newsgroups : povray.off-topic : Turing determination : Re: Turing determination Server Time
5 Sep 2024 17:13:31 EDT (-0400)
  Re: Turing determination  
From: Kevin Wampler
Date: 22 Jul 2009 14:17:59
Message: <4a6757d7@news.povray.org>
Darren New wrote:
> Invisible wrote:
>> - What is the "most powerful" language for which you *can* tell is an 
>> arbitrary program will halt?
> 
> I forget what it's called, but basically anything with for loops instead 
> of while loops does the trick. You have to rule out recursion also. 
> Essentially, anything with indefinite loops is out, as far as I understand.
> 

I believe it's called a "primitive recursive" language.

This is also relevant: 
http://en.wikipedia.org/wiki/Total_functional_programming


Post a reply to this message

Copyright 2003-2023 Persistence of Vision Raytracer Pty. Ltd.