Wikipedia talk:WikiProject Computer science

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Computer science (Rated Project-class)
WikiProject icon This page is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
 Project  This page does not require a rating on the project's quality scale.

Quote_notation: overly optimistic[edit]

The article on "Quote_notation", although sort of interesting, is overly optimistic on the usefulness of this notation for general computation with fractions. There is an obvious problem that the length of a quote notated fraction is linear in its denominator, often even close to it.

This optimism is already there in the original article.

For example, the suggestion is that subtraction of two quote notated number is "just subtract". Here a bad counterexample: To subtract 1/19 from 1/17 (giving 2/323), you compute 2941176470588235'3 - 894736842105263159'9, and after subtraction you get a number with a repeating part of 144 digits, ending in ...4334365325077'4

This is not easy by any stretch of the imagination. However, the notation is still an interesting thought experiment, so I would suggest not to remove it, but just make it a bit more realistic.

Proposed deletion of Consultation (object-oriented programming)[edit]

Ambox warning yellow.svg

The article Consultation (object-oriented programming) has been proposed for deletion because of the following concern:

No reliable source cited for this decade-old article which appears to be a fringe POV fork

While all constructive contributions to Wikipedia are appreciated, content or articles may be deleted for any of several reasons.

You may prevent the proposed deletion by removing the {{proposed deletion/dated}} notice, but please explain why in your edit summary or on the article's talk page.

Please consider improving the article to address the issues raised. Removing {{proposed deletion/dated}} will stop the proposed deletion process, but other deletion processes exist. In particular, the speedy deletion process can result in deletion without discussion, and articles for deletion allows discussion to reach consensus for deletion. greenrd (talk) 10:56, 19 June 2015 (UTC)

Request for Comment: Split Virtual machine into separate pages for systems and process?[edit]

Interested editors are invited to comment at: Talk:Virtual machine: Split into separate pages for systems and process? on whether to split the Virtual machine page into separate pages for Systems virtual machine and Process virtual machine.

—Nils von Barth (nbarth) (talk) 17:51, 28 June 2015 (UTC)

Possibly incorrect diagram[edit]


Browsing through it looks like the diagram in the top right is incorrect. If I am not mistaken, the "C" needs to be where "D" is, "D" needs to be where "R" is, and "R" needs to be where "C" is.

Also, there doesn't seem to be a way to directly talk about issues on a page. As just someone who is noting that it may not be correct, I have no idea if this is the right way to go about this. — Preceding unsigned comment added by (talk) 16:05, 1 July 2015 (UTC)

You can click the "new section" button when viewing the article's talk page to raise an issue. But for obscure articles, posting to this WikiProject is more likely to get you are timely response.
I didn't hear of wavelet trees before today, and didn't read the cited references, so I'm speculating a bit here: you suggest the the C, D and R nodes need to be rotated to make the tree more "balanced"? But this would not affect the shape of this particular tree depicted in the image?
Also, the image seems to have been created by Giuseppe Ottaviano and was copied almost varbatim from the one in his PODS paper on wavelet trees tries, which makes it rather unlikely the image is incorrect. —Ruud 16:51, 1 July 2015 (UTC)

Review of Heap's algorithm[edit]

I recently came across Heap's algorithm and discovered that our pseudocode did not correspond to Heap's description. The algorithm should use exactly one swap between each permutation. Our version has of course spread out to blogs and other places.

The error in our previous pseudocode was that it was performing a swap in the last iteration of the for loop, and you see if you expand the recursive calls, it leads to multiple swap calls in sequence.

I corrected the article (verified the algorithm by implementing it separately). A contributor had made a pretty illustration of the algorithm, however it needs to be updated now for the corrected version. The illustrator has requested we verify the algorithm before they attempt to illustrate it again. If you feel you can offer a second review of this, please help! Thanks sverdrup (talk) 15:18, 7 July 2015 (UTC)

AfC submission[edit]

Could anyone assess Draft:Ring Learning with Errors? Thank you, FoCuSandLeArN (talk) 17:56, 20 July 2015 (UTC)

NURBS - Knots v Control Points[edit]

See Comparison of Knots and Control Points — an expert review seems needed.

Hobart (talk) 19:42, 21 July 2015 (UTC)

Requested edit[edit]

Dear AI experts: I left a requested edit message on the Talk:Brendan Frey page, but then realized that I was the only one watching that page, so the request would likely not be seen. I have a conflict of interest, so I prefer not to edit the article myself. Frey is involved in deep learning and computational biology. —Anne Delong (talk) 19:10, 22 July 2015 (UTC)

Thanks - it's done now.—Anne Delong (talk) 05:12, 22 August 2015 (UTC)

New wikiproject proposal: Information Visualisation[edit]

I'm proposing a new Wikiproject focussed on information visualisation. Since it has a some relation to this project, I'm adding a notification here. If you're interested, come and help brainstorm over here --> Wikipedia:WikiProject_Council/Proposals/Information_Visualisation --naught101 (talk) 02:29, 20 August 2015 (UTC)