Wikipedia talk:WikiProject Computer science

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 50.185.134.48 (talk) at 22:48, 13 March 2016. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

WikiProject iconComputer science Project‑class
WikiProject iconThis 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.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles
ProjectThis page does not require a rating on Wikipedia's content assessment scale.
Things you can help WikiProject Computer science with:

Wikipedia:Wikipedia Signpost/WikiProject used


Quote_notation: overly optimistic

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.

Draft:Cling (Interpreter)

Dear programming experts: This old draft will soon be deleted unless someone improves it. Is this a notable interpreter?—Anne Delong (talk) 14:31, 30 August 2015 (UTC)[reply]

Draft:Nonex

Dear programmers: This old draft will soon be deleted unless someone decides to work on it. Is this a notable topic?—Anne Delong (talk) 04:41, 17 November 2015 (UTC)[reply]

It's a notable topic, but we already have an article about it at Readers–writer lock and this one adds nothing. I'd make a redirect if I could find one reliable source that uses the word "nonex". QVVERTYVS (hm?) 10:23, 17 November 2015 (UTC)[reply]
This looks like a neologism used to spam the single external link present in the article. It should be deleted. —Ruud 16:06, 17 November 2015 (UTC)[reply]
See also the poster's website, where he claims to have invented reader-writer locks and a host of other things. QVVERTYVS (hm?) 18:39, 17 November 2015 (UTC)[reply]

"Transdichotomous RAM"

I noticed that the Requested articles page for computer science has a request under §Theory and theorem for "Transdichotomous RAM" (source: [1]). A couple of quick searches later, I found Transdichotomous model, which from the definitions appears to be a more general name for it:

"In computational complexity theory, and more specifically in the analysis of algorithms with integer data, the transdichotomous model is a variation of the random access machine in which the machine word size is assumed to match the problem size." (from Transdichotomous model)
"The transdichotomous RAM tries to model a realistic computer. We assume w ≥ lg n; this means that the “computer” changes with the problem size. However, this is actually a very realistic assumption: we always assume words are large enough to store pointers and indices into the data, or otherwise, we cannot even address the input." (from the source for "Transdichotomous RAM")

To me, these seem at least fairly equivalent, but I was hoping that someone more familiar with this area would be able to advise. Thank you — Sasuke Sarutobi (talk) 13:46, 29 December 2015 (UTC)[reply]

Yes, II think they're close enough that we can redirect the request to the existing model. I have done so. —David Eppstein (talk) 18:11, 29 December 2015 (UTC)[reply]

Augusto Sampaio

Is this chap really notable? --Dweller (talk) 16:36, 18 January 2016 (UTC)[reply]

I could go either way on this. The citation counts are a bit borderline for WP:PROF#C1 but the Comendador da Ordem Nacional do Mérito Científico might be enough. —David Eppstein (talk) 17:07, 18 January 2016 (UTC)[reply]
Sounds good to me. Thanks --Dweller (talk) 20:53, 18 January 2016 (UTC)[reply]

Code sample at MVC article

A new user recently added a code sample at Model–view–controller. The code sample appears to be written for Spring MVC, with no inline or out-of-line commentary to explain how it works. This project's style guideline says that code samples in articles should "contribute significantly to a fundamental understanding of the encyclopedic content" and "should use a language that clearly illustrates the algorithm to a reader who is relatively unfamiliar with the language." A code sample pasted without explanation does not meet the first standard, and any sample that assumes Java, Java EE, Spring and Spring MVC as a starting point, I believe, cannot satisfy the second standard, especially since this article covers MVC in many other context besides the web. I believe the sample should be removed completely, but I've been criticized for reverting this article too eagerly, so I'm raising it here to see if there are any particular objections. 50.185.134.48 (talk) 22:48, 13 March 2016 (UTC)[reply]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Wikipedia_talk:WikiProject_Computer_science&oldid=709924919"