POV-Ray : Newsgroups : povray.off-topic : Turing determination : Re: Turing determination Server Time
5 Sep 2024 17:13:22 EDT (-0400)
  Re: Turing determination  
From: andrel
Date: 23 Jul 2009 19:22:11
Message: <4A68F0A3.3000501@hotmail.com>
On 23-7-2009 1:22, Darren New wrote:
> andrel wrote:
>> That is a rather useful definition, but it may have to imply that the 
>> code that you jump to is not reachable in any other way. Or perhaps 
>> that is what you want.
> 
> As long as you haven't executed it before you goto it, you're OK. If you 
> skip forward over something, then branch back to it, then fall into what 
> you've already executed, you'll execute the same bit of code twice. But 
> you can't execute it *three* times without branching to something you've 
> already executed.

skip part A, do something, skip part B, do something2 then second time 
jump to C and third time to D, jump to B, C: jump to A, D: continue 
having executed someting2 thrice.

>> I seem to remember that type systems had the same complexity as or 
>> might even be Turing machines in themselves, but I assume you know 
>> better.
> 
> It depends on the type system. Some are. Most aren't. I'm talking about 
> the ones that aren't. :-)

Ah ok.


Post a reply to this message

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