Talk:RE (complexity)
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
What does RE have to do with complexity? Computability is the right term, no?—Preceding unsigned comment added by 212.80.64.118 (talk • contribs)
- See Complexity_class. RE are problems that always halts when accepting and can fail to halt when not accepting. So no upper bound can be placed on time consumption of the hardest problems in RE. Thus RE is greater than all other complexity classes. Taemyr (talk) 13:04, 22 January 2008 (UTC)
Semi-algorithm[edit]
I noticed there was no article about semi-algorithms, but this page was the closest we have. Since I'm not too deeply entrenched in computability theory, I decided to redirect semi-algorithm here and put in a definition. QVVERTYVS (hm?) 12:56, 21 May 2014 (UTC)