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)