Content deleted Content added
→Dumb Questions: synonyms |
Wanderer57 (talk | contribs) →Dumb Questions: reply |
||
Line 123:
:::It is hard to avoid doing that. We need to identify the subject of the article quickly by whatever name a reader might know it. Once you realize that these are synonyms, you can ignore the ones you do not recognize on your first reading of the article. [[User:JRSpriggs|JRSpriggs]] ([[User talk:JRSpriggs|talk]]) 06:41, 10 August 2008 (UTC)
::::Thanks. I wonder if an initial statement in italics might be better, by taking the synonyms out of the defining sentence. E.g.,
::::''(Computably enumerable, semidecidable, provable and Turing-recognizable are synonyms for recursively enumerable.)''
::::Another question -- suppose a lookup table is created by picking a million numbers from a random number table, and an algorithm is created that halts only when given an input that is in the lookup table. Would that algorithm determine an r.e. set? [[User:Wanderer57|Wanderer57]] ([[User talk:Wanderer57|talk]]) 15:45, 10 August 2008 (UTC)
| |||