on termination

[Eray Ozkural]

On Tuesday 13 May 2003 16:08, Cagdas Ozgenc wrote:
> Indeed, I am still looking for a theorem of some sort that either equates
> stongly normalizing systems to primitive recursive functions (if this is
> the case), or a theorem that demonstrates some sort of limitation to
> strongly normalizing systems when compared to a turing machine, or a system
> that can decide recursive class but unable to recognize recursively
> enumerable class.

Hmm, I think this depends on what a strongly normalizing system is :) Slightly 
going out of my sphere of knowledge (^_^)

Cheers,

-- 
Eray Ozkural (exa) <erayo@cs.bilkent.edu.tr>
Comp. Sci. Dept., Bilkent University, Ankara  KDE Project: http://www.kde.org
www: http://www.cs.bilkent.edu.tr/~erayo  Malfunction: http://mp3.com/ariza
GPG public key fingerprint: 360C 852F 88B0 A745 F31B  EA0F 7C07 AE16 874D 539C