Talk:Anytime algorithm

problem with "References" section

There is something wrong with the "References" section of the article. The first 31 entries, have just an author's name (or is it a "cite" name?) which does not seem very helpful. Sorry my knowledge of what is wrong, is limited. (However, if you just look at the "References" section of the article, it should be obvious what the problem is.) I just do not know how to fix it. Actually, there may be a "{{tag}}" of some kind, that I could have put in to the article itself, like the one saying "this is a stub, please help expand / improve it". However, if there is such a "{{tag}}", I am not familiar with it. Mike Schwartz (talk) 00:42, 13 June 2008 (UTC)

Fixed. --63.102.70.70 (talk) 01:43, 20 June 2008 (UTC)

Wrong

I'd never heard of this before today, so I can't claim to know anything about this, but the article certainly looks dodgy. So I had a brief read of the first web-accessible reference in the list, which is here, and it looks like this article doesn't correctly describe the concept at all. Specifically:

• Interruptibility seems to be a necessary condition. The Construction section is utterly wrong (cut-off point is not specified in advance).
• Interruptibility seems not to be a sufficient condition. The Introduction makes it seem like it is.
• Limit turing machines seem to have nothing to do with it.

Generally, the article is incoherent and self-contradictory. Possibly this is due to conflicting definitions of the term, but my guess is Wikipedia simply got it wrong. --Unzerlegbarkeit (talk) 15:06, 30 July 2008 (UTC)

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. 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. 92.29.119.114 (talk) 10:11, 22 May 2016 (UTC)