Talk:Dovetailing (computer science)

[Untitled]

How is this different from either pipelining or scheduling? David Souther (talk) 03:58, 13 September 2010 (UTC)

universal dovetailer

It would be nice to have some links or information about the new concept of the universal dovetailer which turns this principle up to eleven. May be linked from digital philosophy, simulation hypothesis and similar articles. --82.83.39.229 (talk) 22:11, 20 October 2011 (UTC)

example like one of the chomsky proofes for something in formal languages

my attempts to computer science are long passed, but maybe an example or examples could be mentioned. the abstract appoach to a problem called "dovetailing" is applied already to some fitting problems, so why not mention with a small explanation and wikilink (should already be blue).

so long - the mentioner — Preceding unsigned comment added by 79.234.246.93 (talk) 10:27, 27 January 2012 (UTC)

simple examples in C and/or Java and/or pseudo-code would be best...

I think in this case that a program is worth a thousand words. I really have no idea what a 'dovetailer' is after reading this - and I am a 2nd year CS student. one simple program - in any language or even in pseudo-code would do more than 20 paragraphs attempting to explain these abstract concepts. — Preceding unsigned comment added by 99.108.138.206 (talk) 17:28, 13 February 2012 (UTC)

Georg Cantor and the countability of the rational numbers

I like the analogy to tree searches, but I think it might be carried further, to the benefit of the reader: Trees might not only have paths of infinite lengths; some of the nodes may have infinitely many children as well. That's where breadth-first search fails, but a dovetailing technique can still prevail. And, although I don't have any sources for this, I believe that this alternation of sidestep-downstep (whose effect are mostly diagonal steps) is the very essence of the dovetailing technique. I did not read Georg Cantor, but I heard it said that he invented (or in any case used) this technique in demonstrating that the rational numbers are countable. (The term dovetailing is, however, not common in German!) --217.226.81.228 (talk) 06:48, 20 August 2015 (UTC)

Dovetail is called "cola de pato" o "cola de milano" in Spanish, a literal translation would be "cola pateando" or "cola milanando" that sounds horrible and makes no sense. Of course, dovetailing can be introduced as a neologism. A better name could be "deep-bread alternating search" or something similar, but this is a wikipedia article not the place to propose nomenclature for such technique.

Diagonal order could be a better name. This article seem original work, but please don't delete it for such reason. This was the only source I found about that term in the context of computer science. I don't know how to find the original writer of this article. It could be better to be in contact with the person who posted this article and suggest a better nomenclature. It is a more civilized way to solve the problem than deleting the article. I say it again, please don't delete it, because this term appear in some theoretical articles and is the only helpful explanation that I found. Although it is not very clear it gives an idea of the meaning.

The origin of the term and propose to disambiguate the term

I tried a search on the subject and discovered that dovetailing is a name proposed by David Kirkpatrick a researcher at the University of British Columbia in Vancouver in an article called "Hyperbolic Dovetailing". He talks about a co-ordinated interleaving (dovetailing) process. Given the very few results of this search in the web, I think that this term is not yet widespread. This co-ordinated interleaving process is related with Cantor's diagonal method and depth and bread first searches. I think that "dovetailing" should be redirected to such articles after adding a section about this kind of search in those articles. — Preceding unsigned comment added by 201.124.216.32 (talk) 20:14, 1 April 2019 (UTC)