Content deleted Content added
m Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Tag: |
|||
| (2 intermediate revisions by 2 users not shown) | |||
Line 1:
{{WikiProject banner shell|
{{WikiProject Computer science}}
}}
== problem with "References" section ==
Line 16 ⟶ 19:
:Wikipedia, getting something wrong? I'm shocked. ;-) The "limit Turing machines" thing is from Mark Burgin himself (editing as Multipundit, as usual). He didn't know the term "anytime algorithm" until I introduced him to it, in criticizing his article on super-recursive algorithms for either inventing nothing new or simply getting basic computing theory wrong. So what does Burgin do? He comes here and retroactively claims credit for theoretical work in anytime algorithms! I'm not surprised the article doesn't describe the concept accurately at all, if he's been mucking around with it. I'd fix it, but I just don't have the patience to fight Burgin. [[User:Yakushima|Yakushima]] ([[User talk:Yakushima|talk]]) 14:13, 24 April 2009 (UTC)
== Examples of? ==
It would help to name some specific anytime algorithms. The [[beam search]] article which got me here linked to [[beam stack search]] for example. [[Special:Contributions/92.29.119.114|92.29.119.114]] ([[User talk:92.29.119.114|talk]]) 10:11, 22 May 2016 (UTC)
| |||