User talk:Derek farnYour prose is much better than what was there; however, there were many wikilinks to related subjects that are now absent. It is important to build the web, so I'm adding what I can back in. Cheers! --Mgreenbe 19:33, 11 February 2006 (UTC)
Compiler entry and redirection from CompileI'm the guy that added the disambiguation about the COMPILE Japanese videogame company. The problem is that Compile redirects to Compiler so I thinked to add the disambiguation link on the last one. You edited it so maybe I did something wrong, so probably is better doing in the Fenix article way. Please give me your opinion about this, I like many games from this death videogame development company. Timofonic 09:20, 11 April 2006 (UTC)
Programming languageI tried to bring the discussion at programming language talk page back to the topic of rewriting the introduction to something more accessible. I added the new section to the article so people could extended the POV they were advocating there instead of at the talk page. Calling it a rewrite, you seem to have decided to revert my work and instead push your own POV. Please see Wikipedia:NPOV tutorial. --TuukkaH 16:58, 17 February 2006 (UTC) I never found: unsigned x = -1; usefull. In fact I once spend 2 days hunting down a: signed* x; unsigned* y; y=x Of corse x and y where defined in 2 different files and there was a function call in the middle (from a third file).
Over the years (I did lots of C/c++ work) I have come to belive that the implicid conversions beween numeric types are far more harmfull then the the cast operations themself. It take control away from me because I want to decide when when to convert.
--Krischik T 18:17, 25 February 2006 (UTC) quite wrong about me, and rather rude IMHOThe comment on my user page, about use of humor, is all about discussions. That is, talk pages. I didn't think anybody would believe the comment might apply to articles. I wonder how accidental the misinterpretation was, given that you edited my user page to distort my message. Go edit Jimbo's user page if you like; he has given approval to do so. Long before I spotted the "bondage language" mention on the Pascal_and_C article, I had heard the term. I've known of it for years. I may have first heard it over a decade ago. Well of course it is appropriate to link the term to something. A category seemed more appropriate than an article. Read the jargon file entry for bondage-and-discipline language. The jargon file is a well-accepted reference. AlbertCahalan 06:47, 24 April 2006 (UTC) I do indeed believe the term is in actual use. Even if it does originate as something Eric Raymond added to the Jargon File, that in itself is influential enough to put the term into common use. I use many of the terms found in the Jargon File. Anyway, thanks for the apology; not many people would bother. AlbertCahalan 03:11, 26 April 2006 (UTC) Operators in other languagesJust wanted to say, I just removed this sentance from the operators in C/C++ article. Those operators that are in C are also in Java, Perl, C#, and PHP with the same precedence, associativity, and semantics. I know that this is not true, as for example I'm almost certain comma operator is not in C# or Java. Feel free to pop over to the talk page if you like about how this should be corrected / expanded. Mrjeff 14:58, 4 June 2006 (UTC) Please refrain from undoing other people's edits repeatedly. If you continue, you may be blocked from editing Wikipedia under the three-revert rule, which states that nobody may revert an article to a previous version more than three times in 24 hours. (Note: this also means editing the page to reinsert an old edit. If the effect of your actions is to revert back, it qualifies as a revert.) Thank you. - CobaltBlueTony 23:44, 15 June 2006 (UTC) I know you don't want to talk to me, but I'm not about to simply "go away" so it would be better for all of us if we can reach some kind of understanding. Clearly you know more than me, but that doesn't mean I'm not allowed to edit or question your opinion until I've read everything you tell me to read. Wikipedia doesn't work that way. If you have some material we disagree on, you can't just have your way by asserting that I don't know what I'm talking about; you have to prove it by citing sources. And it's not my job to find your sources for you. If you can cite the sources, I can easily see that you are correct and believe me I will drop all my objections. But you don't seem willing to do that, because you know you are right and I am wrong. But how is a naive reader to know that? That's why citing sources is so important and why we will never get FA status without it. I am pushing you to make the article better, because the questions I ask are the same ones that a naive reader will ask. Just because I don't know as much as you doesn't mean I can't be helpful and do good work. And it certainly doesn't mean I have no right to be here. You can't avoid me, you can't go around me, you have to deal with me. Ideogram 07:47, 17 June 2006 (UTC)
Ada as general-purpose languageIn the Programming languages article, your edit of 2006-06-14 15:37:44 says "Ada was originally intended for general purpose use, today its niche is embedded systems". You are mistaken. Ada was designed on contract to DARPA specifically for embedded systems; the "Steelman" requirements document for it was quite clear. It was equally clearly not designed for business systems (like COBOL), scientific computation (like Fortran), string processing (like awk), or other applications. The Ada programming language article summarizes the situation clearly:
I worked on the design of Ada at Intermetrics, and wrote a Ph.D. thesis on programming language design; I do know what I'm talking about. --Macrakis 20:00, 19 June 2006 (UTC) So you worked on the CHILL compiler?! I was called in once by the CHILL group to interpret the denotational spec because a particular case wasn't clear... something to do with the state of variables on abnormal exit from a loop, if I remember correctly. Anyway, the point of the passage was that Ada 83 was not designed as a "general-purpose programming language". Even with the Ada 95 changes, it simply "improved support" for other areas. I'm not sure anyone talks about "general-purpose programming languages" any more, anyway. When PL/I was defined to unify commercial and scientific programming, scientific languages like Fortran didn't have records, and commercial programming languages didn't have floating-point. Nowadays, no one (except I guess COBOL) has BCD arithmetic anymore.... --Macrakis 20:46, 19 June 2006 (UTC) _BoolI did not delete your contribution, I just put most of it under a new heading, like this: Language versionsNeither K&R C nor the first ISO Standard had a specific boolean type. The 1999 revision of the C Standard introduced the type _Bool. Practically all versions of C have supported binary valued relational operators however.
The reason I moved it down were that "excess" (historical) detail could distract from the basic simple principles i was trying to pinpoint (and that you erased some of it).
I do not use C much anymore (I did for 10 years), but my impression (without having read the formal C99 standard yet) is that _Bool is something of a "fix" (demanding #includes and all), and that C99 is still, in essence, the same "int-centered" language it always been (no offense whatsoever). See, for instance: http://lists.puremagic.com/pipermail/digitalmars-d-announce/2006-February/000127.html
I therefore feel it's very reasonable to mention _Bool a little later. If you know important details I've missed, please add them to the article (under the new heading perhaps).
Best regards /HenkeB 21:47, 4 September 2006 (UTC)
Inappropriate revertYou reverted my edit in compiler with the comment: rv: Cross compiling and P-code are different concepts) Since my edit didn't imply that they were the same thing, and especially since the concept wasn't otherwise mentioned in the article, your reversion was inappropriate. Please be more careful in future.WolfKeeper 21:36, 13 December 2006 (UTC)
term software anomalyHello Derek farn, I saw your comments, when you reverted my edits. My intention is not to spam or to redefine a common term. I want to explain why this is, please see discussion page. --Erkan Yilmaz 03:04, 24 December 2006 (UTC)
Hello Derek farn, I responded to your answer. Please do not see it that I blame you or so. It was just to get also the group's view. I hope everything fine now? As you can see, your feedback helped me again :-) ----Erkan Yilmaz (evaluate me!, discussion) 18:47, 27 December 2006 (UTC) Comment articleHi, I'm replying here to your remark on my talk page. I'm not sure whether you just saw that I moved the article or were following the discussion in one of the Manual of Style talk pages; anyway my point was a bit more articulated: the article already covered comments in non-programming languages (e.g. XML), so I renamed it to "comment (computer language)" which is more general than "comment (programming language)". That I think is uncontroversial. But there's more: you may find comments in configuration files and other files which are not for a language processor proper, just for a program which parses them according to a given (usually primitive) syntax. After some discussions with the guys who maintain the Manual of Style we agreed that, for simplicity's sake, the best solution was probably just naming the article "comment (computing)" as that is enough for disambiguation; it is a bit more general than needed but it's simple. That's how the article is named now. Let me know if you have objections or further comments about it. And Merry Christmas! :-) —Gennaro Prota•Talk 23:00, 25 December 2006 (UTC)
Comment disambiguation pageHi, you recently reverted my edit on the comment disambiguation page. I had inserted the following link, Wikipedia:Manual_of_Style#Invisible_comments so that it will be easier to new user, like me to figure out how to leave comments for other while editing an article. Your reason for the revert,
was not clear to me. The page has no such similar link. There is a link to Wiktionary article on the page, which gives the dictionary definition of the word comment. The link I had inserted was related to editing Wikipedia articles. Can you please clarify your reason for the revert ? Thank you. P.S. You can post your reply on your talk page. myth 04:29, 20 January 2007 (UTC) Deadlocked at Computer ProgramAre you OK with me going through the dispute resolution process regarding our deadlock at computer program? Do you want to talk about it privately? I'll give you my phone number or email address. Timhowardriley 23:51, 1 May 2007 (UTC)
Software testingHello Derek farn, if you check the category:Software testing you will find that it is included in category:Software engineering, which is normally considered a tree. I have also some difficulties in understanding why software testing should be listed under category:skills. Inwind 12:05, 8 May 2007 (UTC)
Precise definitions neededIn answer to your question posted on my talk page: Please point me at the precise definitions of Perl and PHP. There are plenty of imprecise ones around. Talking of precise definitions, what is the precise C or C++ definition of the expression
Hi, Derek. Commercial tool dealing with very specialist usage of goto> Commercial tool dealing with very specialist usage of goto. I think it is important that people know that such a tool exists. And it is relevant to goto article concerning Java. If not here, then where do you think it fits? Canwilf
Logic tagThe bot owner is not to blame for the categories tagged. The bot is tagging articles by the categories considered at WikiProject Logic. Some articles may not be included. In the interest of getting most of the appropriate ones, the sweep may be a little over inclusive. Besides, some of these articles could benefit from the attention of the project. I think the bot owner's page is a bad place for that whole spam thing. Be well,Gregbard 09:55, 31 July 2007 (UTC)
Stop itWhy is it every time that I attempt to reach some kind of compromise on Array you blindly revert to the last version that you edited? You're removing changes that have nothing at all to do with anything that you disagree with, like my changes to out-of-bound indexing and MisterSheik's changes to assocative arrays. You're reverting changes of terminology made not in order to promote a point of view but in order to reduce confusion for reasons I clearly stated that you have not contested. Blind reverts say that you're asserting ownership of the article and you're unwilling to compromise and don't care what anyone has to say. You have completely ignored my detailed and friendly attempt to raise discussion on the talk page. This is extremely rude and distressing behavior and I hope you will consider discussing the issues. Dcoetzee 18:47, 1 August 2007 (UTC)
Huh? Why the revert?At [8]. I don't really care about the recent addition about denotational semantics and all that, but if it's going to be there, it should flow better with the rest of the (short) section. Under my edit, it reads better; under your revert (and hence the original slightly sloppy edit), it reads worse. Why would you revert to achieve something worse (when there doesn't seem to be any actual factual or content concern, just prosidy). LotLE×talk 23:31, 15 August 2007 (UTC)
What's an "improper edit"?What's an improper edit? If editors are adding value to articles with accredited, referenced sources, then at least justify your revert. Timhowardriley 21:17, 16 September 2007 (UTC) Point well takenRegarding your edit here, I agree that an imperative computer program (loosely defined) is essentially an algorithm. Your point is well taken. Within the context of algorithms, could you produce a (loosely defined) definition of a declarative computer program? Timhowardriley 21:23, 23 September 2007 (UTC)
Please stop the WP:OR speculation on Programming languageSome of the hypotheses you propose on why various measures of PL popularity are skewed are plausible. Others seem implausible even on their face. But what they all have in common is that they are 100% original research and speculation. You provide no citations whatsoever; and moreover, you have seriously violated 3RR in reverting to the same personal pontification. Don't do that! LotLE×talk 01:00, 21 October 2007 (UTC) Rework black magic nonsenseI think a little more thought and consideration should have been applied before using the heading of "Rework black magic nonsense". See Wikipedia:WikiLove. Timhowardriley 15:42, 21 October 2007 (UTC)
Preserving Knuth's definitionI see that you are preserving Knuth's definition in the computer program article. I moved the proof -- that my translation of Knuth's definition is logically equivalent to Knuth's -- to its own heading in the talk section. I do, however, feel that your previous version of the sentences surrounding Knuth's definition was better than what now stands. Frankly, the current version is a runon sentence. Moreover, I feel that my version of the sentences surrounding Knuth's definition was the best so far. Timhowardriley 16:45, 21 October 2007 (UTC) hope you didn't mindRe: Computer Program Artificial language in programming languageDerek, I don't plan on making a big deal out of my request for citation. I'll remove it after a good discussion in the talk section, no matter the outcome. Timhowardriley 00:19, 3 November 2007 (UTC) Edit war on computer programThe computer program article is going through the vetting process for good article status. See Wikipedia:Good article reassessment#Computer program. However, this edit generated negative comments from the good article cabal.
You recently made this substantial edit to the article. And you have a supporter:
Well, I'm going on wikibreak to let you get the article to GA quality. I'll then renominate it for GA status again. If it fails again, I suggest we revert back to before I arrived and start over. Timhowardriley 17:40, 14 November 2007 (UTC) Computer program introduction as topic sentencesI overwrote much of your introduction of the computer program article. After going through the good article process, I learned that the introduction should be a summary of the entire article. So, I went through the article and copied the topic sentence of many of the paragraphs and pasted them to the introduction. I tried to order the sentences to create a logical flow. I know you wrote much of the original introduction, so I hope you don't mind too much the change. Timhowardriley (talk) 23:25, 14 December 2007 (UTC) I hope that your revert of my redirect means that you intend to do something constructive with this article soon, rather than leaving it in its current stubby state. —David Eppstein (talk) 18:30, 15 December 2007 (UTC) In computer program, I changed the term "decode" into "parse" because parse has a better wikilink than decode. Whereas decoding program statements has many steps in addition to parsing, parsing is the most time consuming. If you agree, I would ask that you to change "decode" back to "parse". Timhowardriley (talk) 20:39, 23 January 2008 (UTC)
Categories at Static code analysisHello, both categories (Category:Formal methods and Category:Computer programming tools) are a supercategory of Category:Static code analysis so in whatever way the user navigates through the categories and arrives at either of these supercats, the subcat Category:Static code analysis is visible. The same holds for navigating away from the article (the user notices the supercats of Category:Static code analysis and can navigate from there). I don't think the argument that the categories are not a tree applies here because in this case, there's a direct supercat/subcat relation and there's no need to overcategorize articles when the article has a category that provides the same navigation. - Simeon87 (talk) 23:26, 25 January 2008 (UTC)
Speedy deletion of Mumeishi Kendo ClubA tag has been placed on Mumeishi Kendo Club requesting that it be speedily deleted from Wikipedia. This has been done under section A7 of the criteria for speedy deletion, because the article appears to be about a person or group of people, but it does not indicate how or why the subject is notable: that is, why an article about that subject should be included in an encyclopedia. Under the criteria for speedy deletion, articles that do not indicate the subject's importance or significance may be deleted at any time. Please see the guidelines for what is generally accepted as notable, as well as our subject-specific notability guideline for biographies. If you think that this notice was placed here in error, you may contest the deletion by adding Mumeishi Kendo ClubI have deleted this page under A7 — an article about a company that did not assert importance. If you would like, I will restore this article in a subpage of yours so that you may work on it. If you would like to do so, please make note on my talk page or here. Thanks. seresin | wasn't he just...? 00:39, 28 February 2008 (UTC)
Remove "used to produce them"I noticed that you made an edit to Computer Program without commenting on this talk. I'm assuming that you agree with my logic and it's OK with you that I make the suggested edit. Timhowardriley (talk) 01:35, 17 March 2008 (UTC) The term modern suggests that what is being discussed does not apply to non-modern, which in this case is not true. Also some modern OSs are single tasking (coffee machines come to mind). Derek farn (talk) 11:19, 17 March 2008 (UTC)
C (programming language) categoryYou wrote:[12]
The category in question, Category:Programming languages, has a banner at the top:
I was following its instructions in moving C out of the main category, since it's already been added to appropriate subcategories. If this seems reasonable, perhaps you'll self-revert this edit. If it doesn't seem reasonable to you, you should either discuss this line on the category's Talk page (or at an appropriate WikiProject) or WP:BOLDly change the line yourself. Personally, I find this instruction useful since it makes browsing easier: there are simply so many programming languages that putting them all into a supercategory seems counterproductive (and it hides the alphabetically-later subcategories, not just pages). But you may have your own reasons here. As a WP:0RR devotee, I'll leave your edit in place. CRGreathouse (t | c) 19:47, 22 March 2008 (UTC) I see you did the same at BlooP and FlooP, and my comments apply equally here. Further, in that case, I wonder if you think that the page should receive also Category:Fictional programming languages as it is similar to Blub (programming). Cheers! CRGreathouse (t | c) 19:50, 22 March 2008 (UTC)
source codeHey, I noticed that you reverted my edit to source code. I'm going to revert it to my version (I do think it's better) but I'd like to know which parts of my edit you found unclear and inaccurate. I'll start a section on the talk page and give some reasons for my changes. –MT 05:43, 25 May 2008 (UTC) threaded codeThank you for improving Wikipedia. Your recent edit[14] to threaded code, at first glance, appears to be a good application of Refactor By Condensing Question Answer Pair. Alas, I reverted that edit. See Talk:Threaded code#some_redundancies_cannot_be_eliminated_by_subroutines for details. --68.0.124.33 (talk) 14:46, 30 May 2008 (UTC) MISRADerek, MISRA are dropping the explicit "Motor Industry ..." in favour of just MISRA. We do not want the first message on MISRA to be limited to a particular industry. Hence the edit, and the revert. Gavin Gmccall (talk) 22:10, 1 July 2008 (UTC) Hi Derek, I did see that there is a Motor Industry Research Association page. MIRA is an unrelated page. The current link should really be to MIRA Ltd. It was originally a form of industry supported research, but at some date TBD converted to a Limited company and became MIRA Ltd ilo the full name. MIRA have also expanded their focus beyond the Motor Industry. I'm not sure what this all means with regard to page names, but I'll try to find some real histry sources on my next visit to MIRA Ltd later this month. Gavin Gmccall (talk) 20:56, 5 July 2008 (UTC)
[15] What was wrong with it? --KnightMove (talk) 21:14, 13 July 2008 (UTC)
I hate rv's, but your quite off baseThis is an educational project... any fool can string links together because they understand jargon. Try explaining per WP:NOT PAPERS, and read again. Start with our comparative career lengths in my edit summary. // FrankB 21:39, 16 July 2008 (UTC) LAST WARNING TO "Derek farn"This is a last warning to "Derek farn".
Now you have to decide, whether you take over the responsibility for this article,
You have to understand, that I spent many-many hours to invent a much better structure and content, while you did not do the same effort and improvements. If you will not make your selection between the not and yes above, then I will propose your behavior for public discussion. prohlep (talk) 23:31, 20 July 2008 (UTC) Do not maintenance tags without addressing themWelcome to Wikipedia. It might not have been your intention, but your recent edit removed maintenance templates from Wikipedia. When removing maintenance templates, please be sure to either resolve the problem that the template refers to, or give a valid reason for the removal in the edit summary. If this was a mistake, don't worry, as your removal of this template has been reverted. Take a look at the welcome page to learn more about contributing to this encyclopedia, and if you would like to experiment, please use the sandbox. Thank you.--Crossmr (talk) 14:57, 28 July 2008 (UTC)
I noticed you reverted a small addition I made to the article, saying "This observation does not move the article forward at this point", which I think makes sense. Anyway, I put it back in in a different place. Do you think it's OK now? --Steve (talk) 18:30, 12 August 2008 (UTC)
Please do not try to solve differences by edit warring. Use a talk page to resolve different views and form a consensus. If you think you have a valid change to make, offer it and other editors can have some input. Rlsheehan (talk) 18:17, 20 August 2008 (UTC) Optimization (computer science)I really think you MUST live on a different planet if you genuinely think that MOST programs don't use a database. The exact reverse is probably true. In any case, the choice of which numeric data type in an input file (flat or otherwise) certainly has a huge impact on algorithm speeds irrespective of language. ALMOST ALL PROGRAMS USE A DATABASE IN ONE FORM OR ANOTHER - PERIOD. It depends to some extent on how you define a database and there are many types. Contrary to what you claim, I have used and built many databases constructed from flat files and I would argue that a flat file has some inherent structure in any case (sequence for one), usually a sequence of fixed or variable fields, effectively making it an array, just like a spreadsheet for instance - which can possess many database like qualities and features.
I have reverted your removal yet again. I see I am not the only one to complain about your deletions.81.129.233.212 (talk) 14:10, 17 September 2008 (UTC)
Most "real world" algoriths are written for the commercial world, almost ALL of which usually use some ill chosen commercial database of one form or another both to receive data and output it. Thus the choice of 'database' is crucial to the efficiency of the algorithm, both in terms of wasted data conversions (of which there are many), memory utilization, disk storage space, transmission throughput, as well as computations within the algorithm (eg fixed signed/unsigned binary versus floating point etc etc). Do you honestly believe that the choice of data definition does not affect the processing speed of a calculation ? Do you honestly believe that the 'data length' of an input does not affect its speed of entry/exit into/from the CPU, do you honestly believe that the data type does not affect transmission time ?, etc etc. You must be truly naive if you do. That is quite apart from other database issues such as whether the input needs to be pre-sorted (or if its part of a 'relational' database where sorting is implicit in the design, but still hugely relevant in terms of indexes to be maintained). (I suspect you are not aware of internal database structuring/re-structuring, multiple indexes issues at all; I bet you even think that inputting a .csv or .tsv file is as efficient as fixed length record format, don't you?). Or much more likely, as I said,neither 'input' nor 'output' figures in your platonic world at all! I rest my case - but I can't actually be bothered to re-enter my point - let it reside as a permanent marker to your profound ignorance on the matter. ken (talk) 19:01, 21 September 2008 (UTC) September 2008Please do not add content without citing reliable sources, as you did to GPS navigation software. Before making potentially controversial edits, it is recommended that you discuss them first on the article's talk page. If you are familiar with Wikipedia:Citing sources please take this opportunity to add references to the article. Contact me if you need assistance adding references. Thank you. Jonobennett (talk) 11:47, 25 September 2008 (UTC) AfD nomination of StroppingAn article that you have been involved in editing, Stropping, has been listed for deletion. If you are interested in the deletion discussion, please participate by adding your comments at Wikipedia:Articles for deletion/Stropping. Thank you. Do you want to opt out of receiving this notice? Schuym1 (talk) 19:30, 4 October 2008 (UTC) Schuym1 (talk) 19:30, 4 October 2008 (UTC) Information processingDear Derek farn, I'm sorry. After doing some research, I've concluded that your edit was not vandalism. I've reverted my edit. Have a nice day! AdjustShift (talk) 13:39, 10 October 2008 (UTC) Programming language revertHello, recently the article on computer language was merged by me into the larger article on programming language. Seeing as discussion via reverting and edit summaries has hit a roadblock, I was wondering if we could discuss your reversion here. I believe that computer language (as previously explained by the article computer language until it was turned into a redirect) is a superset encorporating programing language, markup language, scripting language etc (contradictory to the programming language's definition of the term). Per the currect definition on programming language, computer languages is a subset of p.l. but per c.l. it is a superset. Is it possible to intergrate both of these definitions into the article without reversion? I would appreciate your opinion on this. Foxy Loxy Pounce! 01:45, 11 October 2008 (UTC)
Friendly helpYou may or may not already know this, but having seen some of your talk page and AfD discussions, I'm not sure you've have the concept of notability pointed out to you - namely that although we use the word glibly in day-to-day life, on Wikipedia, there is a detailed and exact set of guidelines on how to to determine notability objectively. Just click the preceding link, or go to WP:N - hopefully it should cause less confusion in discussions of this kind. If you already knew this, please accept my apologies Fritzpoll (talk) 08:43, 15 October 2008 (UTC) Programming Language - revert of first paragraphI added a comment on the Talk:Programming_language#concept_of_translation to explain what I am attempting to accomplish in the first paragraph. If you have read it, would you mind continuing the discussion there on whether or not some addition is warranted? I am advocating the layman's desire to get a complete (though not necessarily detailed) birds-eye view of the concept. Thanks! Pooryorick (talk) 16:05, 15 October 2008 (UTC) You reverted my latest adition to the first paragraph as "unnecessarily detailed". But in the talk page it is argued that a change in that line is necessary. Would you care to come there and discuss? Diego (talk) 16:51, 15 October 2008 (UTC)
You've undone my re-prioritization of some sentences in the lead to the body of the article. In doing so, this time you're breaking a Wikipedia guideline. If you feel that the moved ideas have merit, please discuss so in the talk page; the proper solution should be to expand those ideas with sourced content that state their relative importance to the subject, before they can be put back in the lead. Diego (talk) 01:37, 18 October 2008 (UTC) Revert warsHi, I didn't meant to be too rude in the comments of my latest edits. I want to ask you to always comment with its author the quality of an addition before reverting it, as you seem to remove additions by other editors without properly explaining why that information should not be in Wikipedia. Sometimes your edits could be merged with those of the other editor, or that editor could change the wording if you just cared to explain why do you think it's wrong (instead of destroying the other people's work, which is bad nettiquette in Wikipedia). Diego (talk) 13:27, 20 October 2008 (UTC) Reverting Redundant CodeHi Derek, Dorchard here. Could we please discuss the redundant code article further. As it stands with your most recent revert the majority of the information is academically incorrect. "Redundant code is a computer programming term for code that is executed but has no effect on the output of a program" - This is true but is not the whole story as this is also true of dead code. "(dead code is the term applied to code that is never executed)" This is completely false- dead code is code that is executed but whose result is never used (see my update to dead code. What is described here is unreachable code which on the previous wiki page was completely false. I am a compilers researcher and am supervising an Optimizing Compilers course and noticed how wrong the information on Wikipedia is so in an attempt to guide people I have - with citations - corrected the information. If you'd like to clarify things for yourself this paper is very good and describes the correct meanings for redundant code, dead code, and unreachable code -> http://doi.acm.org/10.1145/349214.349233 I appreaciate that you may not be able to download this without an ACM account (do you work for a university?) If you don't please contact me and I can transcribe for you the relevant parts of the paper or alternatively send you a hard copy. --Dorchard (talk) 08:40, 21 October 2008 (UTC) Reverting Unreachable CodeIn Optimizing Compiler books and papers it is *never* that case that dead code == unreachable code. If you find otherwise please find references to the contrary. It is unethical to remove definitions and change definitions that are fully referenced without making your own cases for removal with citations from published sources. I can find more instances of these uses of dead code and unreachable code in common books for compilers if necessary. —Preceding unsigned comment added by Dorchard (talk • contribs) 08:52, 21 October 2008 (UTC) Continued ReversionHi Derek. I see you have reverted again with the comment: "rv: Inaccurate and incorrect text + added citation" The citation you have added is a really good one, thanks. However the citation you have added backs up exactly my previous edits and invalidates your edits as it states, again, that unreachable code is not the same as dead code. May I draw you to the sections of the book that pertain to these terms: page 592 (Dead-Code Elimination) Muchnick S. S. 1997 Advanced Compiler Design and Implementation. Morgan Kaufmann.
page 580 (Unreachable-Code Eliminiation) Muchnick S. S. 1997 Advanced Compiler Design and Implementation. Morgan Kaufmann.
page 407 (Partial-Redundancy Eliminiation) Muchnick S. S. 1997 Advanced Compiler Design and Implementation. Morgan Kaufmann.
Please can we resolve this issue? I am happy to change the articles back and make the citations clearer with exact quotations from the Advanced Compiler Design and Implementation book, from the Appel book, and from various publications. I can give direct quotations if necessary if you think this will make it clearer. Alternatively if you have a citation of a source that supports your view please can we include that? Thanks. --Dorchard (talk) 12:45, 21 October 2008 (UTC)
Rice's theoremPlease see my comment on Talk:Rice's theorem. — Carl (CBM · talk) 03:14, 27 October 2008 (UTC) Optimization_(computer_science)#SlugsHi Derek, You edited my edit on this topic. Actually, in the last paragraph, your edit makes it more concise and keeps the the meaning. However, the main thing you removed was the explanation that gives meaning to the concept, namely the relationship between slugs, call stack depth, and the technique of finding them via sampling. Readers will want to know this, because slugs are clearly bad things. Since it looks like you're going to edit this, and you do have the ability to improve it, could I ask you to please put back in the key information? Thanks, MikeDunlavey (talk) 20:07, 8 November 2008 (UTC)
This is his slide: Dunlavey’s Call-Stack Sampling (Paraphrased) Run the program under a debugger, halt it with a “pause” button, and examine the call stack. Make a record of the call stacks observed. Any statement that appears on more than one call stack might be a time hog. Invoking a statement less frequently (or eliminating it) reduces execution time by the fraction of time it resided on the call stack. [Details in SIGPLAN Notices or Wikipedia] I put some text back in. I don't mind if you improve it.MikeDunlavey (talk) 01:08, 10 November 2008 (UTC)
Thanks for bearing with me, Derek. Let me visit your points one at a time.
You did ask earlier if I have any references to work showing that the function calls are the main culprit.
Thanks, MikeDunlavey (talk) 13:42, 10 November 2008 (UTC) I scanned the article (1.8MB). I will send it to you if you send me a contact email address to mdunlavey AT pharsight DOT com. MikeDunlavey (talk) 18:50, 10 November 2008 (UTC) I took another crack at wording it. See what you think. MikeDunlavey (talk) 16:28, 12 November 2008 (UTC) I added a low quality and disputed tag to Compiler. Please do not remove it without discussion. That article is low quality. Thanks History2007 (talk) 18:55, 27 December 2008 (UTC) Hello. You removed some classical references to Compiler construction which I inserted in the Compiler article. It's not quite out-of-date. You wrote: "Only contained very old and hard to obtain material." They are considered classics and timeless, so I've added them in as historical in case of arguing modernity. I am re-inserting them. Consider just one, the Cocke and Schwartz book. It's been written: "Programming Languages and their Compilers [44], published early in 1970, devoted more than 200 pages to optimization algorithms. It included many of the now familiar techniques such as redundant code elimination and strength reduction, dealt extensively with graphs of control flow and their partitioning into 'intervals', and showed how to split nodes in an irreducible flow graph to obtain a reducible one." Cheers. --- (Bob) Wikiklrsc (talk) 20:35, 28 January 2009 (UTC)
Little context in History of compiler writingHello, this is a message from an automated bot. A tag has been placed on History of compiler writing, by another Wikipedia user, requesting that it be speedily deleted from Wikipedia. The tag claims that it should be speedily deleted because History of compiler writing is very short providing little or no context to the reader. Please see Wikipedia:Stub for our minimum information standards for short articles. Putting "bar" there yield the same output, but... it doesn't demonstrate what is supposed to be demonstrated. Leave it as "FOO". - Richfife (talk) 00:44, 13 March 2009 (UTC) Algorithmic efficiencyOf course algorithmic efficiency is the reason for compiler optimization - what other reason could there be !!! Similarly, reducing power consumption is naturally important for carbon footprint issuesken (talk) 07:38, 29 March 2009 (UTC)
This is an automated message from CorenSearchBot. I have performed a web search with the contents of Identifier (computing), and it appears to be very similar to another Wikipedia page: Identifier. It is possible that you have accidentally duplicated contents, or made an error while creating the page— you might want to look at the pages and see if that is the case. If you are intentionally moving or duplicating content, please be sure you have followed the procedure at Wikipedia:Splitting by acknowledging the duplication of material in edit summary to preserve attribution history. This message was placed automatically, and it is possible that the bot is confused and found similarity where none actually exists. If that is the case, you can remove the tag from the article and it would be appreciated if you could drop a note on the maintainer's talk page. CorenSearchBot (talk) 11:10, 27 April 2009 (UTC) Copy-and-paste page movesHello, Derek farn. Concerning your contribution, Identifier (computing), a page move cannot be done by simply copying and pasting the contents of a page into a new location, as such a process does not transfer the page's edit history and therefore violates the GNU Free Documentation License (GFDL). As a violation of the page move process, Identifier (computing) needs to be temporarily deleted under the speedy deletion criteria so that the page you intended to move may be properly moved in a way that will preserve its edit history. Identifier (computing) has been tagged for deletion, and may have been deleted by the time you see this message. If not, please refrain from editing either the page you intended to move or Identifier (computing) until the latter has been deleted according to Wikipedia's speedy criterion G6 (non-controversial housekeeping). If you did not intend to make a page move, then please insert the {{hangon}} tag right below the {{db-copypaste}} tag in Identifier (computing) and state your intentions on Talk:Identifier (computing). An administrator will look at your reasoning before deciding what to do. Thank you for your contributions. Blanchardb -Me•MyEars•MyMouth- timed 11:12, 27 April 2009 (UTC) MapIf you can provide evidence that RoadMap is notable, feel free to re-create it at RoadMap (software). — RHaworth (Talk | contribs) 10:04, 30 June 2009 (UTC) Perl parsing may not finishThat statement is factually correct. I'm not sure what you're trying to say, but you're probably thinking of the fact that the halting problem is decidable for Turing machined with a finite number states. But the Perl language is Turing-complete. The fact that it's normally run on machines with finite hardware does not change its Turing completeness as a language (nor does it change the Turing-completeness of any other Turing-complete programming language). Since deciding whether a Perl BEGIN statement finishes is equivalent in general to solving the halting problem, the membership in the class of syntactically correct Perl programs is an undecidable problem. It follows that the parsing phase for Perl may not finish for some programs, since no algorithm can decide syntactic validity of Perl programs in general. This is the basic idea of the (rather convoluted) proofs given in the references cited there. Pcap ping 00:11, 13 September 2009 (UTC)
UnarySo, what are the other ways of writing non-integer numbers in unary? Protactinium-231 (talk) 02:46, 23 December 2009 (UTC)
Low quality referenceAdded back - since the reference is perfectly valid and not at all 'low quality'. These optimizer products were in widespread use worldwide at 1000,s of COBOL sites and, of course, pre-dated modern post-pass optimizers on PC hardware by 30 years or so. It is simply that anything tagged mainframe is automatically assumed to be dated and irrelevant - not so. —Preceding unsigned comment added by 86.147.10.16 (talk) 16:36, 4 January 2010 (UTC)
Floating point "based on single thread of execution"In the floating point article you have reworded it, quite well I must say, but one small point I have is that you put "programming model is based on a single thread of execution". I am not really sure what you mean here, because as far as I know the IEEE standard is purely declarative, i.e. just says the expected inputs and outputs of a single FLOP. (I haven't read it for a while, admittedly, and not in its latest version.) So I don't really understand your intent on adding this, over and above all the usual problems of atomicity in multi-threaded code. Could you perhaps explain a bit better? Thanks and best wishes Si Trew (talk) 14:53, 8 January 2010 (UTC)
AfD nomination of List of numerical analysis softwareAn article that you have been involved in editing, List of numerical analysis software, has been listed for deletion. If you are interested in the deletion discussion, please participate by adding your comments at Wikipedia:Articles for deletion/List of numerical analysis software. Thank you. Please contact me if you're unsure why you received this message. Jwesley78 21:22, 24 February 2010 (UTC) reverting your revertHi. In Talk:Programming_language#reverting_a_bad_revert I just explained why I reverted your revert. In my opinion, the version of the article that you reverted was actually better than the version you reverted it to. Even if it was only equally good, you should have let it stand, so as not to discourage other editors from contributing to Wikipedia. If you want to revert my reversion of your revert, go ahead, but please explain why you think the old version is better than the new version on the talk page of the article. Kragen Javier Sitaker (talk) 23:10, 12 December 2010 (UTC) Your edits in WebM: Risk of edit warringHello, Derek farn Please allow me to be frank with you: The event of two editors reverting edits of each other without attempting to discuss, known as Edit warring, is a very bad behavior that is not tolerated in Wikipedia. Please try not to engage in edit warring.
One way of avoiding edit warring is following Wikipedia:BOLD, revert, discuss cycle guideline. Note that you had already removed contents from WebM article that Mabdul (talk · contribs) has once contested. So, please do not repeat it again. If you think your edit was okay, please discuss it in talk page. Do not repeat your edit until you reach a consensus. Thanks in advance. Fleet Command (talk) 12:36, 21 April 2011 (UTC) Power lawref revision - rv: Lots of text relating to a recently published method whose overall significance is as yet unknown. Dear Derek farn, the meaning of the method seems clear: it provides a novel criterion of estimate of power law distribution exponent and a formulation for its confidence interval. In the cited reference it is illustrated the theoretical derivation of formulas and it is shown by means of Monte Carlo simulation that this criterion provides a more convergent estimator of power law exponent than maximum likelihood method. I retain that terms such as “unknown significance” or “ambiguous quality” (so as stated by unknown user in revision of 25 April 2011) are inappropriate when dealing with theoretical topics. A theoretical proof can only be correct or incorrect. Maybe the text is not sufficiently clear. I would be grateful for providing me some suggestion aimed to make it more readable/clear. Thanks. Structuralgeol (talk) 00:39, 2 May 2011 (UTC) June 2011Please do not remove content or templates from pages on Wikipedia, as you did to Mechanical system, without giving a valid reason for the removal in the edit summary. Your content removal does not appear constructive, and has been reverted. Please make use of the sandbox if you'd like to experiment with test edits. Thank you. Gavin.perch (talk) 05:49, 9 June 2011 (UTC)
TalkbackHello, Derek farn. You have new messages at Wikipedia:Mediation Cabal/Cases/2011-05-08/Power law.
Message added 23:06, 22 June 2011 (UTC). You can remove this notice at any time by removing the {{Talkback}} or {{Tb}} template. MacMedtalkstalk 23:06, 22 June 2011 (UTC) TalkbackHello, Derek farn. You have new messages at Wikipedia:Mediation Cabal/Cases/2011-05-08/Power law.
Message added 21:20, 3 July 2011 (UTC). You can remove this notice at any time by removing the {{Talkback}} or {{Tb}} template. MacMedtalkstalk 21:20, 3 July 2011 (UTC) POVAre you sure that my paragraph is a POV? Was it factually incorrect? Well, by providing the mathematical equations I used, I tried to prevent any kind of inaccuracy. — Preceding unsigned comment added by 87.144.6.170 (talk) 17:30, 14 July 2011 (UTC)
Static Code Analysis deletionsWhy were you deleting entries from the list of Static Code Analyzers out there? Just because there doesn't happen to be a page on Wikipedia for the program in question doesn't mean it shouldn't be in the list. It simply means that nobody's bothered to write an article about them yet. I say this in the interest of fairness only. From a purely mercenary point of view, I wouldn't mind people not knowing about competition to the product I work on. From a broader perspective though, Wikipedia needs to be entirely fair. If something gets dropped, it should be a reason stronger than an annoying red link. You can always remove the link marker, leaving the product in question in the list. — Preceding unsigned comment added by Rpapo (talk • contribs) 11:00, 28 July 2011 (UTC)
October 2011 You currently appear to be engaged in an edit war according to the reverts you have made on Floating point. Users are expected to collaborate with others, to avoid editing disruptively, and to try to reach a consensus rather than repeatedly undoing other users' edits once it is known that there is a disagreement. Please be particularly aware, Wikipedia's policy on edit warring states:
If you find yourself in an editing dispute, use the article's talk page to discuss controversial changes; work towards a version that represents consensus among editors. You can post a request for help at an appropriate noticeboard or seek dispute resolution. In some cases it may be appropriate to request temporary page protection. If you engage in an edit war, you may be blocked from editing. --Guy Macon (talk) 21:09, 5 October 2011 (UTC)
list of static code analysis toolsHello there, checKing deserves to be in the list since it is a tool that complies with the content of the list as much as the other commercial tools listed. I don't want to start an editing war here. I think that if this list is thought as reference of static code analysis tools it has to be as complete as possible. Javier.salado (talk) 11:41, 24 November 2011 (UTC)
Do you think you could improve this article a bit? I think it's potentially a valid topic, but the article is a bit useless as it stands. —Ruud 02:32, 5 December 2011 (UTC)
arbitrary precisionYou removed an external reference which presents a broader and clear disucssion of basic arbitrary precision computing. Why Wiki people (the same person to protect his own reference?) tend to delete useful references of this page? You have deleted a useful reference to many scientific students of teachers. — Preceding unsigned comment added by 220.128.221.61 (talk) 20:48, 21 December 2011 (UTC)
External linksOur external linking policy does not permit linking to mailing lists or newsgroups or other sites primarily based on user-submitted content. External links should be informative, not useful. Surely there are informative sites about compiler construction that could be added, but the links I removed should not be re-added. Yworo (talk) 21:11, 22 December 2011 (UTC)
BarnstarCriteria for Speedy DeletionHey there! I just wanted to touch bases on the Speedy Deletion process. While the creator of an article cannot remove a speedy deletion tag, any other editor may review and assess the tag in accordance with the deletion policy and decline the deletion as appropriate. You can find out more information about the CSD process here, while the deletion policy may be found here. Please feel free to contact me anytime you have questions or need assistance. Best regards, Cind.amuse (Cindy) 12:42, 26 January 2012 (UTC)
Unsourced editsI have again removed your additions at Name generator. As WP:BURDEN states, "[t]he burden of evidence lies with the editor who adds or restores material". The claims about the history and purpose of name generators is unsourced and seems to express your POV. The language is unencyclopedic in its use of second person. We should also stick to "examples" from reliable, third-party published sources. Wyatt Riot (talk) 16:52, 29 January 2012 (UTC) Disambiguation link notificationHi. When you recently edited Secular variations of the planetary orbits, you added a link pointing to the disambiguation page Driving force (check to confirm | fix with Dab solver). Such links are almost always unintended, since a disambiguation page is merely a list of "Did you mean..." article titles. Read the FAQ • Join us at the DPL WikiProject. It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 10:35, 14 February 2012 (UTC) Dispute resolution survey
Disambiguation link notification for June 22Hi. Thank you for your recent edits. Wikipedia appreciates your help. We noticed though that when you edited Maximal munch, you added a link pointing to the disambiguation page Code generation (check to confirm | fix with Dab solver). Such links are almost always unintended, since a disambiguation page is merely a list of "Did you mean..." article titles. Read the FAQ • Join us at the DPL WikiProject. It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 10:53, 22 June 2013 (UTC) Disambiguation link notification for September 1Hi. Thank you for your recent edits. Wikipedia appreciates your help. We noticed though that when you edited Laning and Zierler system, you added a link pointing to the disambiguation page Algebraic notation (check to confirm | fix with Dab solver). Such links are almost always unintended, since a disambiguation page is merely a list of "Did you mean..." article titles. Read the FAQ • Join us at the DPL WikiProject. It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 14:22, 1 September 2013 (UTC) February 2014Hello, I'm BracketBot. I have automatically detected that your edit to Quine (computing) may have broken the syntax by modifying 3 "{}"s. If you have, don't worry: just edit the page again to fix it. If I misunderstood what happened, or if you have any questions, you can leave a message on my operator's talk page.
It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, BracketBot (talk) 22:15, 23 February 2014 (UTC) November 2014Hello, I'm BracketBot. I have automatically detected that your edit to Error analysis (mathematics) may have broken the syntax by modifying 1 "()"s and 1 "[]"s likely mistaking one for another. If you have, don't worry: just edit the page again to fix it. If I misunderstood what happened, or if you have any questions, you can leave a message on my operator's talk page.
It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, BracketBot (talk) 00:40, 3 November 2014 (UTC) Disambiguation link notification for January 30Hi. Thank you for your recent edits. Wikipedia appreciates your help. We noticed though that when you edited SPARQL, you added links pointing to the disambiguation pages Schema, Graph and Predicate. Such links are almost always unintended, since a disambiguation page is merely a list of "Did you mean..." article titles. Read the FAQ • Join us at the DPL WikiProject. It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 09:25, 30 January 2015 (UTC) retargetable compilerDear Derek farn, Someone once said "There were retargetable compilers before C was invented". [17] Do you know any specific examples? Is UCSD Pascal a retargetable compiler? What else can I do to fight Wikipedia: Recentism? --DavidCary (talk) 16:36, 8 April 2015 (UTC)
Hi, ArbCom Elections 2016: Voting now open!Hello, Derek farn. Voting in the 2016 Arbitration Committee elections is open from Monday, 00:00, 21 November through Sunday, 23:59, 4 December to all unblocked users who have registered an account before Wednesday, 00:00, 28 October 2016 and have made at least 150 mainspace edits before Sunday, 00:00, 1 November 2016. The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail. If you wish to participate in the 2016 election, please review the candidates' statements and submit your choices on the voting page. MediaWiki message delivery (talk) 22:08, 21 November 2016 (UTC) Poisson Inverse Gaussian moved to draftspaceAn article you recently created, Poisson Inverse Gaussian, does not have enough sources and citations as written to remain published. It needs more citations from reliable, independent sources. (?) Information that can't be referenced should be removed (verifiability is of central importance on Wikipedia). I've moved your draft to draftspace (with a prefix of " Hello, Derek farn. It has been over six months since you last edited the Articles for Creation submission or draft page you started, Draft:Poisson Inverse Gaussian. In accordance with our policy that Wikipedia is not for the indefinite hosting of material deemed unsuitable for the encyclopedia mainspace, the draft has been deleted. If you plan on working on it further and you wish to retrieve it, you can request its undeletion by following the instructions at this link. An administrator will, in most cases, restore the submission so you can continue to work on it. — JJMC89 (T·C) 03:21, 18 July 2019 (UTC) ArbCom 2019 election voter messageConcern regarding Draft:Udo FlohrHello, Derek farn. This is a bot-delivered message letting you know that Draft:Udo Flohr, a page you created, has not been edited in at least 5 months. Drafts that have not been edited for six months may be deleted, so if you wish to retain the page, please edit it again or request that it be moved to your userspace. If the page has already been deleted, you can request it be undeleted so you can continue working on it. Thank you for your submission to Wikipedia. FireflyBot (talk) 12:02, 6 December 2022 (UTC) Your draft article, Draft:Udo FlohrHello, Derek farn. It has been over six months since you last edited the Articles for Creation submission or draft page you started, "Udo Flohr". In accordance with our policy that Wikipedia is not for the indefinite hosting of material deemed unsuitable for the encyclopedia mainspace, the draft has been nominated for deletion. If you plan on working on it further, or editing it to address the issues raised if it was declined, simply and remove the If your submission has already been deleted by the time you get there, and you wish to retrieve it, you can request its undeletion by following the instructions at this link. An administrator will, in most cases, restore the submission so you can continue to work on it. Thank you for your submission to Wikipedia! Hey man im josh (talk) 14:04, 6 January 2023 (UTC) Nomination of KIC 11026764 for deletionA discussion is taking place as to whether the article KIC 11026764 is suitable for inclusion in Wikipedia according to Wikipedia's policies and guidelines or whether it should be deleted.
The article will be discussed at Wikipedia:Articles for deletion/KIC 11026764 until a consensus is reached, and anyone, including you, is welcome to contribute to the discussion. The nomination will explain the policies and guidelines which are of concern. The discussion focuses on high-quality evidence and our policies and guidelines. Users may edit the article during the discussion, including to improve the article to address concerns raised in the discussion. However, do not remove the article-for-deletion notice from the top of the article until the discussion has finished. Lithopsian (talk) 20:55, 30 January 2023 (UTC) The article String generation has been proposed for deletion because of the following concern:
While all constructive contributions to Wikipedia are appreciated, pages may be deleted for any of several reasons. You may prevent the proposed deletion by removing the Please consider improving the page to address the issues raised. Removing This bot DID NOT nominate any of your contributions for deletion; please refer to the history of each individual page for details. Thanks, FastilyBot (talk) 09:01, 24 May 2023 (UTC) unconditional lovedo you have this? 105.113.56.68 (talk) 00:02, 31 July 2023 (UTC)
Disambiguation link notification for August 25Hi. Thank you for your recent edits. An automated process has detected that when you recently edited Hooley's delta function, you added a link pointing to the disambiguation page Kevin Ford. Such links are usually incorrect, since a disambiguation page is merely a list of unrelated topics with similar titles. (Read the FAQ • Join us at the DPL WikiProject.) It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 06:05, 25 August 2023 (UTC) ArbCom 2023 Elections voter messageHello! Voting in the 2023 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 11 December 2023. All eligible users are allowed to vote. Users with alternate accounts may only vote once. The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail. If you wish to participate in the 2023 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add ArbCom 2024 Elections voter messageHello! Voting in the 2024 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 2 December 2024. All eligible users are allowed to vote. Users with alternate accounts may only vote once. The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail. If you wish to participate in the 2024 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add |