Re: Generation of permutations

[Mats Karlssohn <mats@mida.se>]

"Chad R. Meiners" wrote:
%<
> Actually I am interested where you picked up the phrase "recursively
> undecidable".  A better phrase would be "not recursive" since we are
> referring to recursive languages.  Perhaps it is simply a hybridization of
> "Turing-decidable" and "recursive" since it would be harmless enough to
> merge two equivalent phrases.

As far as I can tell, "recursively undecidable" is part of the
standard terminology used by logicans and mathematical philosofers.
I first heard the term used (and got it explained) during my first
university course in mathematical philosophy. How ever this is kind
of an interpolation since the course was (of cource ;-) held in
swedish. I didn't actually see the english term until later during
my first course in logic.

-- 
Mats Karlssohn, developer                         mailto:mats@mida.se  
Mida Systemutveckling AB                          http://www.mida.se
Box 64, S-732 22 ARBOGA, SWEDEN
Phone: +46-(0)589-89808   Fax: +46-(0)589-89809