User talk:Sligocki

Welcome!

Hello, and welcome to Wikipedia. Thank you for your contributions. I hope you like the place and decide to stay. Here are a few good links for newcomers:

I hope you enjoy editing here and being a Wikipedian! By the way, you can sign your name on Talk and vote pages using three tildes, like this: ~~~. Four tildes (~~~~) produces your name and the current date. If you have any questions, see the help pages, add a question to the village pump or ask me on my Talk page. Again, welcome! -- Graham ☺ | Talk 01:34, 20 Nov 2004 (UTC)

technical tag

No problem...you did a good job. Incidentally, there's no rule saying you can't remove the tag. If you think the problem has been addressed, feel free to remove such tags in the future. You know, your name reminded me of a paper on knot theory by T. Ligocki I found very interesting. I have ideas in a similar vein I am thinking about. --C S (talk) 04:13, 23 February 2009 (UTC)[reply]

MOS:UNLINKDATES

It's still subject to the injunction against doing it systematically. Please reconsider. Also, your edit to repunit unlinked some numbers, which should rarely be unlinked in mathematical articles. — Arthur Rubin (talk) 23:41, 26 May 2009 (UTC)[reply]

I see. I find linking dates to be very distracting and unprofessional and I payed specific attention to all the pages that I unlinked, standardizing date formats where appropriate, etc. But I will try to respect this injunction. As for linking numbers, why do we do that? It also doesn't really seem to fit in with MOS:LINK as these pages are usually just a collection of trivia about a number. Ex: 11 (number) spends quite some time explaining how 11 is the first number that we can't count on our hands. How does that relate to repunits?? Cheers, Sligocki (talk) 17:50, 3 June 2009 (UTC)[reply]

Automated Access to Wikipedia data / Wikipedia API

Copied from Wikipedia:Village pump (technical)/Archive 61#Automated Access to Wikipedia data / Wikipedia API so I don't lose this info!

I would like to access Wikipedia's data from a (python) script. I know that you guys frown on directly accessing using stadard http from a script, so do you have a preferred method? Is there a standard API I can use to access data from a script? I'm surprised that after googling for a while, I could not find any reference to one.

I don't want to create an edit-bot, simply analyze history data. Specifically, I would like to create an ANNOTATE/BLAME script that would find out who wrote a specific passage in a Wikipedia article. I believe that this would help make the encyclopedia better. Thank you, Sligocki (talk) 09:24, 11 June 2009 (UTC)[reply]

Are you aware of the MediaWiki API that you can access at http://en.wikipedia.org/w/api.php? This is an interface that you can use to get data about pages using certain queries in the URL. For example, the query http://en.wikipedia.org/w/api.php?action=query&prop=revisions&titles=Main%20Page&rvlimit=5&rvprop=content%7Cuser will give you the content of the last five revisions to the Main page, as well as the user that made the change. Full documentation is available at mw:API. In Python, you can get your script to understand this by asking for the API to return data in JSON. The above query, in Python, could be written as:
import urllib
import simplejson as json #if you have Python >= 2.6, use: import json
import datetime
 
params = {'action':'query', 'prop':'revisions', 'rvlimit':5, 'rvprop':'content|user', 'format':'json'}
params['titles'] = "Main Page" # Whatever variable has the page title
data = urllib.urlencode(params)
raw = urllib.urlopen("http://en.wikipedia.org/w/api.php", data)
res = json.loads(raw.read())
I hope that helps! Regards, The Earwig (Talk | Editor review) 10:11, 11 June 2009 (UTC)[reply]
Ah, great, that's exactly what I was looking for. Thanks Mr. Earwig! Sligocki (talk) 10:37, 11 June 2009 (UTC)[reply]
There is already a WikiBlame tool, but it doesn't do annotation. You might also be interested in the Toolserver, which allows you to do SQL queries on the live database. Graham87 11:54, 11 June 2009 (UTC)[reply]
Last I heard the toolserver database does not give access to the article text, though. Anomie⚔ 12:21, 11 June 2009 (UTC)[reply]
Thanks for the link to WikiBlame! Looks good, though it seems a little slow as it seems to request each revision separately. I'll look into it. Sligocki (talk) 01:09, 12 June 2009 (UTC)[reply]
Note that if you are going to be doing a lot of queries, you may want to use a more robust client to get the data - Wikipedia:Creating a bot has some advice and frameworks in different languages. Mr.Z-man 16:26, 11 June 2009 (UTC)[reply]
Looks like that is mostly about writing bots that actually make edits. But I'll look into it, thanks. Sligocki (talk) 01:09, 12 June 2009 (UTC)[reply]
If you're using the API, there's little difference between editing and getting data, except for logging in and edits need to be done with a POST. The main reasons you would want to use a real framework are for error handling, abstracting out some of the repetitive things, and if you're getting page text, some clients may support requesting gzipped data, saving bandwidth. Mr.Z-man 02:12, 12 June 2009 (UTC)[reply]

Wikitools (Talk with User:Mr.Z-man)

Copied from User_talk:Mr.Z-man/Archive_10#Getting_revision_lists_with_wikitools

Hi Z-Man, you pointed me to frameworks for doing WP API calls a little while back at the village pump. I noticed that you maintain a python framework, wikitools, and I'd like to try it out. Unfortunately I am having a very difficult time navigating the source code to find the things that I am looking for. Specifically, is it possible to use your framework to get a list of revisions of a page? and if so how? Thank you, Sligocki (talk) 01:37, 3 July 2009 (UTC)[reply]

There's no function specifically for getting the page history. The framework is primarily an abstraction layer around the MediaWiki API with some objects for convenience. The README file explains how to do a simple query, this can be adapted for pretty much anything. To get the revision history for a page:
from wikitools import wiki
from wikitools import api
# create a Wiki object, by default it uses the English Wikipedia
project = wiki.Wiki() 
# define the params for the query, see the MediaWiki API docs for more details
params = {'action':'query', 'titles':'Main Page', 'prop':'revisions', 'rvlimit':'max'}
# create the request object
request = api.APIRequest(project, params)
# query the API
result = request.query()
and the result will look something like:
{u'query': 
    {u'pages': 
        {u'15580374': 
            {u'ns': 0,
             u'pageid': 15580374,
             u'revisions': [{u'comment': u'null edit to force purge',
                             u'parentid': 289122198,
                             u'revid': 298682365,
                             u'timestamp': u'2009-06-26T03:36:51Z',
                             u'user': u'Hersfold'},

                            {u'comment': u'transition complete',
                             u'parentid': 289122024,
                             u'revid': 289122198,
                             u'timestamp': u'2009-05-10T20:14:33Z',
                             u'user': u'Happy-melon'}],
             u'title': u'Main Page'}
        }
    },
 u'query-continue': {u'revisions': {u'rvstartid': 289122024}}}
but with a few thousand more revisions. So to get the most recent revision, result['query']['pages']['15580374']['revisions'][0]. The API is documented on mediawiki.org and at http://en.wikipedia.org/w/api.php. You may need to set "rvprop" depending on what information you need. Mr.Z-man 02:20, 3 July 2009 (UTC)[reply]
I see, there's no convenience class to help out. Well maybe I'll try to write one in the style of your framework. Thank you, Sligocki (talk) 18:38, 3 July 2009 (UTC)[reply]

Doctor Manhattan

I have provided links to the discussions held about the merging back when it was executed. I suppose...do we need more discussion about it, then? hbdragon88 (talk) 07:12, 23 June 2009 (UTC)[reply]

Arbitration enforcement

A request for arbitration enforcement has been filed with respect to your edits at Wikipedia:Arbitration/Requests/Enforcement#Sligocki. Erik9 (talk) 01:27, 25 June 2009 (UTC)[reply]

The case appears to have been dropped, if any editors out there think that my edits are inappropriate, please let me know. I wish to be in harmony with the Wikipedia community. However, as it is, I will continue to unlink dates which carry no notability. Furthermore, if I unlink a date that you think should remain linked, please feel free to let me know. Cheers, Sligocki (talk) 08:31, 1 July 2009 (UTC)[reply]

Thanks for Lincoln Park move

Thank for taking the time to move the article.Pknkly (talk) 18:40, 14 August 2009 (UTC)[reply]

No problem. Seemed silly to have the Lincoln Park page be a huge list of items when there was clearly a primary one. Cheers, Sligocki (talk) 18:47, 14 August 2009 (UTC)[reply]

Rapid Transit; answer to question

What is stock? you ask. This. Britmax (talk) 23:36, 19 August 2009 (UTC)[reply]

Thanks, I guessed it was something like that, but the name seems rather imprecise. The only uses I have heard the word stock are:

Is this industry jargon or am I just out of the loop? Sligocki (talk) 23:50, 19 August 2009 (UTC)[reply]

It is a bit jargon, a tad archaic and it helps to be a railway enthusiast as it's mostly used in those circles. Britmax (talk) 23:53, 19 August 2009 (UTC)[reply]

Then I hope you don't mind if I rewrite some statements that use it, so that they are more easily read by laymen. Let me know if you can suggest a better way to do this than my rewrites. Cheers, Sligocki (talk) 00:04, 20 August 2009 (UTC)[reply]

Renaming {{otheruses4}}

Copied from User talk:Rjd0060/Archive 9

I've started a new thread on Template_talk:Otheruses4#Request_move_discussion about moving {{otheruses4}} to a less esoteric title. You suggested that I try to get more people into the discussion by posting to the Village Pump, I'm not very familiar with it, can you suggest which forum to post to? My best guess was Wikipedia:Village pump (proposals), but I'd hate to spam the wrong forum. Also, if you have an opinion on the matter, please add to the discussion. Thanks, Sligocki (talk) 20:30, 3 September 2009 (UTC)[reply]

Yep. The VPR should be fine. Regards, Rjd0060 (talk) 20:34, 3 September 2009 (UTC)[reply]
Copied from Wikipedia:Village_pump_(technical)/Archive_64#Counting_the_number_of_articles_that_"link_here"

Is there any way to get the count of the number of backlinks (or articles in the "what links here" page)? Right now the only way seems to be to continue clicking the next button and counting until they are exhausted. Surely with the power of technology we could have a better way. I think this would be very useful for understanding the "internal notability" of pages (as well as comparing page names which redirects to see if a redirect is used far more often). I have looked at the Wikipedia API, but it also only seems to provide lists of backlinks (instead of having a query for the number of backlinks). Thanks, -Sligocki (talk) 20:55, 3 September 2009 (UTC)[reply]

User:JaGa has done some rather marvelous work on the toolserver in this general area, although he has focused on disambiguation pages with links. I imagine his code is adaptable to address your concern too. See here for some background. --AndrewHowse (talk) 21:16, 3 September 2009 (UTC)[reply]
Unfortunately, the way the Toolserver would do this would be effectively the same as exhausting those pages, but with less resources used. — Dispenser 21:55, 3 September 2009 (UTC)[reply]
Thanks for the pointers guys. I'm kind of disappointed with the limitations of the API, but c'est la vie. Would either of you guys be able to help me to implement such a tool? I've also asked User:JaGa as well. Cheers, -Sligocki (talk) 17:57, 4 September 2009 (UTC)[reply]
Sure. tools:~dispenser/cgi-bin/backlinkscount.py, source code is also available. — Dispenser 21:01, 4 September 2009 (UTC)[reply]
Oh, wow, thanks! Where can I access the source code? I'd like some tweaks, like right now tools:~dispenser/cgi-bin/backlinkscount.py?title=Template:Otheruses4 only returns 442. I'm guessing that it's not counting transclusion, does it count redirects? Thanks, — Sligocki (talk) 04:36, 6 September 2009 (UTC)[reply]
I have since added redirect support. Source code is available at tools:~dispenser/sources/, but you need either a Toolserver account or a database dump. — Dispenser 01:55, 8 September 2009 (UTC)[reply]
Thanks, I'll look into getting an account. — sligocki (talk) 21:41, 8 September 2009 (UTC)[reply]

AutoWikiBrowser makes lists of all sorts. You need to make a request to use it but it is very usefull. –droll [chat] 15:03, 8 September 2009 (UTC)[reply]

It's also only available for Windows. There does not appear to be anything comparable for Linux, my OS. — sligocki (talk) 21:41, 8 September 2009 (UTC)[reply]

Merging "Comparison of document interface"

Hi -- I'm the editor who originally added the {{merge}} templates to Graphical user interface, Single document interface, and so on. My primary interest was figuring out something to do with Comparison of document interface. I am convinced that table should not be in an article of its own. At the same time I couldn't easily figure out what to do with it other than to suggest merging it with Single document interface and Multiple document interface. I'm still not sure what to do about it. Anyway -- if you have any good ideas what to do with it, I'd be glad to hear them. Thanks. Tim Pierce (talk) 03:00, 18 September 2009 (UTC)[reply]

Hi Tim, I don't know a whole lot about this topic, but it looks like SDI and MDI are part of some sort of Microsoft standard. I think these three articles (and maybe Tabbed document interface, which seems to be about Tab (GUI)'s relation to this MS standard) could be placed under one article about the Microsoft standard. If you know anything more about this standard, I think that would be the place to start. Cheers — sligocki (talk) 03:08, 18 September 2009 (UTC)[reply]

Replacing otheruses4 with about

What was the purpose of this change? I know that the template was renamed, and I supported the rename, but making an edit solely for the purpose of changing that seems like it violates WP:R2D. Is there any other reason to make such an edit? –Drilnoth (T • C • L) 01:21, 22 September 2009 (UTC)[reply]

Hi Drilnoth, my understanding of WP:R2D is that text should not be piped if it was originally a valid redirect. I agree with this usage. I can also imagine that it is meant to discourage making meaningless changes to links in general. However, I think that my change is different. There is precedence for the change I made, for example, User:SmackBot automatically converts {{fact}} tags to {{citation needed}} tags. In this case, I have been working on clarifying hatnotes. {{otheruses4}} is cryptic, {{about}} is much more descriptive. I recently started a discussion about this which led to the template move and documentation change. By changing instances of {{otheruses4}} to {{about}}, we make the source more readable and encourage the use of {{about}} in the future. That's my reasoning, however I'd appreciate your feedback. Do you still think that the change was inappropriate, or are you just concerned that I would make trivial changes of WP:R2D in general? Cheers, — sligocki (talk) 01:40, 22 September 2009 (UTC)[reply]
To my knowledge User:SmackBot only makes the fact → citation needed change if it is also doing something more significant at the same time. I'm not too worried about server performance or anything like that, and I fully support the in-article change when it is accompanied by more significant changes, but just changing the the template name seems kind of pointless too me. It would probably make more sense to at least run WP:AWB's genfixes or WP:AutoEd's general cleanup at the same time; otherwise, I just don't see any real reason to make simple name-for-name swapping edits. –Drilnoth (T • C • L) 02:01, 22 September 2009 (UTC)[reply]
WP:AWB only runs on Windows (I've got a Linux box) and I'd never heard of WP:AutoEd before and after looking at the page I'm still not sure. I guess I'd better lookup what a user script is and how to use them. Thanks, — sligocki (talk) 02:07, 22 September 2009 (UTC)[reply]

Logos and edit warring

I strongly suggest you take this issue up at WP:NFR as I previously suggested. Edit warring to attempt to force these onto the article will not go well. Discuss. WP:BRD. Your tagging of the images as free was reverted. Now it's time to discuss it, not edit war over it. --Hammersoft (talk) 17:11, 22 September 2009 (UTC)[reply]

China Boycott on Notepad++

Copied from User talk:Scarpy

Hi Scarpy, you feel that the forums cited on Notepad++'s section on the China Boycott were not Reliable Sources, but they were actually primary sources. First I cite the official website's announcement and then the forum created on SourceForge specifically to boycott Notepad++. Perhaps you feel that the reactions cited were not representative of the general disagreement (because they were chosen from forum posts), but surely the facts that Notepad++ wanted to Boycott the Beijing Olympics and that many users reacted to it by deciding to boycott Notepad++ is not disputed. Cheers, — sligocki (talk) 03:23, 17 October 2009 (UTC)[reply]

I'm not disputing it's occurrence, just it's notability according to Wikipedia guidelines which measure notability by the number of third-party reliable sources documenting a topic. While the websites you cited are official, they are also self-published sources. If the topic has been covered by multiple third-party publications with reputations for fact-checking and accuracy, and you can use them as a basis for that section, by all means add it back. Doing a quick check, however, I can only find one French source. -- Scarpy (talk) 04:26, 17 October 2009 (UTC)[reply]

Refs

AWb used to reorder refs in the new style but I think it has been stopped now. I swopped the refs at the top [1] I thkn this ould preserve the first two that are changed by that operation. Rich Farmbrough 20:03 26 October 2009 (UTC).

Re: Removed LaTeX

I saw your post on this at Talk:List of mathematics articles. If you really want a discussion on this, the right page is WT:WPM. Oleg Alexandrov (talk) 06:06, 27 October 2009 (UTC)[reply]

Well you seem to run the User:MathBot, do you know why it was added? Or if my edit will make it stay off the list? I see that it appeared on User:Mathbot/Changes to mathlists, so it looks like it worked. Just doesn't seem to relavent to math. Thanks, — sligocki (talk) 06:27, 27 October 2009 (UTC)[reply]
I guess it was added by a user, not by the bot. Oleg Alexandrov (talk) 15:07, 27 October 2009 (UTC)[reply]

Minor edits

Please remember to mark your edits, such as your recent edits to Sandia National Laboratories, as minor if (and only if) they genuinely are minor edits (see Help:Minor edit). Marking a major change as a minor one is considered poor etiquette. The rule of thumb is that only an edit that consists solely of spelling corrections, formatting changes, or rearranging of text without modifying content should be flagged as a 'minor edit.' Thank you. -- Autopilot (talk) 02:44, 28 October 2009 (UTC)[reply]

Ah, thanks for the link. It had always seemed a little arbitrary to me what people chose to mark as minor or not. Most of the edit was just grammar and rearranging info. I suppose I did get rid of the 4.4 square mile bit and added the note about Livermore lab. Do you think that constitutes a major edit? I certainly have no intention to deceive. Feel free to let me know what you found fault with specifically. Cheers, — sligocki (talk) 03:04, 28 October 2009 (UTC)[reply]

Schwa

Why don't you like my edits to schwa? I have explained them in my last edit summary. WP:Hatnotes should not link to articles other than their desired target and the symbol is specifically mentioned, so why not link to it? I don't want to get into an edit war and I'm happy to discuss, but on what grounds do you disagree with my edits. Cheers, — sligocki (talk) 22:24, 28 October 2009 (UTC)[reply]

I was not aware of the Hatnotes guideline, sorry. Roger (talk) 06:41, 29 October 2009 (UTC)[reply]

hello

I changed it because if you look at the wikipedia page Arab Mexican, then you will find 1% of Mexico's population is Arab. Cheers mate! —Preceding unsigned comment added by 76.90.54.162 (talk) 00:54, 2 November 2009 (UTC)[reply]

{{otheruses4}} → {{about}}

Thank you for your work and energy towards simplicity, which will help new users. All the best, Drum guy (talk) 23:36, 18 November 2009 (UTC)[reply]

My pleasure, glad you approve. If you're interested, I have a custom AutoEd script User:sligocki/hatnotes.js that helps simplify hatnote use as your editing. I'm curious, what specifically spurred you to leave me a message? Cheers, — sligocki (talk) 04:02, 19 November 2009 (UTC)[reply]

Goodstein sequences and Woodall numbers

There's no reference as far as I know. I discovered it myself.

For starting numbers of at least 4, the goodstein sequence will at some point reach b^b in hereditary notation. The next step yields b'^b' - 1 which is b * b'^b + b * b'^(b-1) + .... + b, where b' = b+1 is the next base. It's a nice exercise to figure out what will be the final base. You will see how the Woodall number arises.

When you start with 3, the final base of 7 happens to also be a Woodall number, so the property holds for any input >= 3.

regards, -John —Preceding unsigned comment added by Tromp (talk • contribs) 21:05, 20 November 2009 (UTC)[reply]

Redirect of Limit (mathematics)

Hi Sligocki. I've undone your redirection of Limit (mathematics) to Limit. Please see the discussion here. Regards, Paul August ☎ 04:25, 28 November 2009 (UTC)[reply]

Hm, yes, it seems like that did cause more problems than it helped. Sorry about that. I'm still concerned about having too many articles talking about limits, currently limit (mathematics), limit of a function and limit of a sequence. I originally stumbled upon limit (mathematics) and thought that it was the only article for quite a while, until I found the others. Do you have any ideas what we could do to clearify that, I think one thing would be to get the talk about limits of functions and sequences in limit (mathematics) down to a minimum so that it is much more clear that they really have their own articles. Cheers, — sligocki (talk) 08:31, 29 November 2009 (UTC)[reply]
I will give this some thought, running now to meet a plane, later. Paul August ☎ 11:21, 29 November 2009 (UTC)[reply]

Busy beaver and Chaitin's constant

Copied from User talk:91.133.35.83.

Welcome to Wikipedia 91.133.35.83. I have reverted your changes to busy beaver and Chaitin's constant. Both this paper, which is in busy beaver's refs and this page, which you cite explain how knowing a large busy beaver number (or enough precision of Chaitin's constant) will allow you to prove a variety of conjectures. Unless you can cite a WP:Reliable source showing that Goldbach's conjecture could not be proven with a large enough busy beaver number, please do not remove that material. Thanks, — sligocki (talk) 10:04, 5 December 2009 (UTC)[reply]


As stated in this recommendable lecture [2] : YOU. CAN. NOT. CHECK. EVERY. EVEN. POSITIVE. INTEGER. WITH. A. FINITE. ALGORITHM.

This month-old paper,[3] which I cite, does not show that the BB:s can be use to prove halting problem-equivalents, in fact if you bother to read it, it states quite the opposite. The other paper is over 20 years old and Chaitin has received a lot of critique about it for a good reason- it's plain wrong.

- YOU. CAN. NOT. CHECK. EVERY. INTEGER. WITH. FINITE. ALGORITHM. -

Reliable sources are hard to find for something so trivially true, try Salas-Hille, some Logic, Set theory or Discrete math 1.0.1 course book or rather some book used in teaching 16 year olds. That's just what it is. It's high school stuff. I have better things to do than argue with someone from whom I can't possibly learn anything more after getting a good reminder on why I quit teaching. Reminds me of the last time I worked as a math teacher in college and ended up arguing with someone old enough to vote on whether you get green when you mix blue and yellow or not. Math can't really be taught, only learned. I'd rather learn new stuff. Of course I wish you could prove me wrong because that would be the biggest revolution in logic since Aristotle. If you want those Wikipedia articles to contain false information, then have it your way. People with enough prior knowledge to grasp the subject will immediately see it's wrong anyway and probably get a good laugh out of it too. I've just been writing too much in my native tongue lately so I guess I've carried this on for this long just to get used to communicating in English again. Now that I've got my paper written up I can switch back to English in some more sensible context, which shouldn't be too hard to find.

Best wishes to you, I will not be correcting your precious misinformation. Think about it with YOUR OWN BRAIN and don't just blindly refer to sources unless you really understand them. Here's the point in a nutshell for you one last time:

- YOU. CAN. NOT. CHECK. EVERY. INTEGER. WITH. FINITE. ALGORITHM. -

And this Chaitin paper really is the most interesting thing I've read for a while. Thank you for that too. Please if you continue to study these subjects, be kind enough to correct them Goldbach thingies when you realize the true nature of the issue.

[4] —Preceding unsigned comment added by 91.133.35.83 (talk) 12:10, 5 December 2009 (UTC)[reply]


Please don't be condescending. I'm not stupid or naive. I have thought about what I have written with my own brain (or I would not have written it). I know that I am correct. But, I also have a professional mathematician to back me up. Chaitin clearly agrees with what has been written on the pages. I am not aware of any criticism that he received over the paper, can you please show me some? In addition, you seem to be obsessed with the statement "You can not check every integer with a finite algorithm", can you quote where in the lecture (or anywhere) that comes from? I would be happy to discuss this with you further if you do two things: 1) stop writing long rambling posts, get to the point (See WP:Too long; didn't read -- although I did read this one) and 2) cite some sources specifically. You clearly believe I am wrong, but you have not shown any WP:reliable source to be on your side. I have demonstrated from a direct quote that Chaitin supports my statements. I hope that I can convince you that this is true, — sligocki (talk) 19:52, 5 December 2009 (UTC) (PS perhaps your student was considering additive color, where yellow + blue can equal white, see the picture. You are presumably talking about RYB color model which are subtractive colors.)[reply]


I concur with Sligocki's analysis. If you need help with the articles, please give me a ping. — Arthur Rubin (talk) 00:25, 6 December 2009 (UTC)[reply]

Have a Nice Day! —Preceding unsigned comment added by 91.133.35.83 (talk) 04:29, 6 December 2009 (UTC)[reply]

fast-growing hierarchy

Copied from User talk:R.e.b.

Hi R.e.b., perhaps you could help us out with something at talk:fast-growing hierarchy. The article is based partially off of Gallier (1991), but several of the "Theorems" stated in that paper don't seem to agree with other sources. The theorems are not proven in Gallier, he simply references other works, which often don't seem to prove the claims either. You originally made this change. The original claim was due to Gallier, but your change appears to be supported by Cichon and Wainer. It appears that you have some experise in the area, would you care to comment in the discussion? Do you think that Gallier is a reliable source? Thanks, — sligocki (talk) 20:59, 9 December 2009 (UTC)[reply]

I'm not really sure: the papers use different notation and terminology, which makes it confusing to compare them. What you say makes it sound as if Gallier may have misquoted some papers, so I would not his paper for anything more than general background. I'm also rather wary of attempts to extend the hierarchies to the Church-Kleene ordinal: one runs into severe problems about encoding ordinals. r.e.b. (talk) 00:40, 10 December 2009 (UTC)[reply]
I'm not suggesting writing about such an extension in Wikipedia, just a personal interest. I was interested by the facts that fω is not primitive recursive and fε0 cannot be proven total in PA. I am interested in similar facts for larger ordinals, could fΓ0 be defined naturally so that it is the first not provably total in arithmetical transfinite recursion? fβ for β the Bachmann–Howard ordinal to be not provably total in constructive set theory? fωCK not provably total by computable methods? would that mean that it is not computable? We know that it is total by construction. If you had any thoughts I'd be interested. Cheers, — sligocki (talk) 01:49, 10 December 2009 (UTC)[reply]
There has been some work along these lines, showing that provably recursive functions of various theories are exactly those in some hierarchy up to the proof-theoretic ordinal of the theory. For example, the paper Fairtlough, Matt; Wainer, Stanley S. Hierarchies of provably recursive functions. Handbook of proof theory, 149--207,Stud. Logic Found. Math., 137, North-Holland, Amsterdam, 1998 briefly discusses the case of Peano arithmetic with transfinite induction added, but I would guess people have by now got as far as the constructive ordinals you mention. My impression is that you should in principle be able to get up to any given constructive ordinal, but there is no honest way to get all the way to the Church-Kleene ordinal. r.e.b. (talk) 03:02, 10 December 2009 (UTC)[reply]
Thanks for the ref. I'm amused by your use of "honest", as if I'm claiming some sort of devious idea :) I am sure that I can define fundamental sequences up to (and including) the CK-ord and thus that I could define the fast-growing hierarchy that high. However, I don't know if that construction will allow me to say anything about it. I'd like to be able to show that it grows like the busy beaver function (or some other uncomputable function). Cheers, — sligocki (talk) 03:21, 10 December 2009 (UTC)[reply]

Viral license

The article Viral license just took a massive step backward, in my opinion, and I don't have time to revert all of it. If you have a moment please check it out. —Aladdin Sane (talk) 18:18, 12 December 2009 (UTC)[reply]

Thanks, I agree that the edits were mostly non-constructive and defensive, I've posted a note on the talk page. Feel free to comment. Cheers, — sligocki (talk) 22:54, 14 December 2009 (UTC)[reply]

Answer about sultan

because of Sultan Kudarat. that's why Sligocki! —Preceding unsigned comment added by Woodsy dong peep (talk • contribs) 13:28, 5 January 2010 (UTC)[reply]

You should put useful information in your edit summary. Something like, "correct spelling", "fix broken link" or "statement was misleading". Something which describes why you did what you did. Commenting with Sultan for a province in the Philippines, does not explain why you made the change you did. — sligocki (talk) 19:59, 5 January 2010 (UTC)[reply]
The edit summary is for what was done, not why. Explanations of why it was done belong on the article talk page. --Una Smith (talk) 20:11, 8 January 2010 (UTC)[reply]

Hi Sligocki. If you are looking for dab pages to tag, here is a list. Today it includes 39 dab pages with 100 or more incoming links; Cocoa is number 21 on the list. Personally, I don't bother tagging; instead I just repair incoming links. --Una Smith (talk) 20:05, 8 January 2010 (UTC)[reply]

I see, you think this needs more special attention. My apologies. I find the {{incoming links}} template useful for quickly fixing those links and encouraging others to. I was surprised when you initially removed it. Cheers, — sligocki (talk) 23:45, 8 January 2010 (UTC)[reply]

not right

i live in the ncr but i macth sultan kudarat with indonesian projects. Woodsy dong peep (talk) 06:04, 9 January 2010 (UTC)[reply]

When i saved the page...

... It went like that! it's true! Woodsy dong peep (talk) 07:01, 9 January 2010 (UTC)[reply]

Your essay on Notation for Very large Numbers

I enjoyed the first Sligocki essay at the bottom of your User page, and was wondering if you - somewhere along the line - had already stumbled on a Wiki article about Very Large Numbers in science fiction literature?

For instance, the July 1972 issue of Analog magazine has a letter to the editor (Ben Bova) by reader Mark Zimmerman about a 5,000 digit number figuring prominently in the plotline to one of Frederik Pohl's stories in his collection of short stories, The Gold at the Starbow's End. He shows how it is actually the sum of several numbers raised to a large (but not very large) power. He goes on, and shows it is actually reducible. (Did I use the right word?) Well, anyway... Is this notable? I don't know. Unfortunately, my science fiction collection of Analog magazines is quite small, and lacks that particular issue.

But I think Wikipedia would be improved if there were a List of science fiction works dealing with very large numbers. Dexter Nextnumber (talk) 08:44, 9 January 2010 (UTC)[reply]

I'm glad you enjoyed my essay! I had almost forgotten about it, I'm not really sure if it is going somewhere. I wrote it as a personal exploration of what I think large numbers are (I rather dislike large numbers, I don't think it is encyclopedic). Since I wrote it I have learned a lot more about various peoples descriptions of large numbers, most notably the fast-growing hierarchy. There are many things that I am thinking about, but it is not clear to me what paths are notable and what are not. If you enjoyed my short essay, you may like Scott Aaronson's Who Can Name the Bigger Number?. It has been an inspiration to me.
As for the SciFi use of big numbers, I have not seen such an article in Wikipedia. I would be interested to read such an article, but I know nothing about the use of very large numbers in fiction, so I don't believe I could contribute much content up-front. Cheers, — sligocki (talk) 04:47, 10 January 2010 (UTC)[reply]

Also, the Goodstein sequences are a little bit over my head. Can you add a graph or chart with exponential markings to help me understand the Goodstein sequences? Even if you are starting at a number that is nearly infinite, it ought to be capable of representation on graph paper that is marked off with (implicitly ever diminishing) magnitudes, if you are going to decline it to zero. Just assume at the far right of the chart an ellipsis (three dots) followed by a zero. Dexter Nextnumber (talk) 22:49, 9 January 2010 (UTC)[reply]

Ah, I don't think that I can help you to visualize these numbers (much). They grow extraordinarily fast in comparison to anything that almost anyone is familiar with. But I shall attempt to try and convince you of this. Part of what I am trying to talk about in my essay is the numbers that are describable in a given notation. For example, in unary, a million is very hard to represent (it's notation is huge), but in decimal it is only 7 chars long, likewise a googol is quite large even in decimal notation 101 chars, but not so much in scientific notation, let's say 6 chars ("10^100"). But scientific notation is not enough, a googolplex cannot be easily represented in it (104 chars), but it is not so bad in tower(2) notation, perhaps 10 chars ("10^10^100"). But if you continue this process of notations, in 100 chars there is a maximum number you can specify, cay "10^10^10^......^10" or something (probably "9^9^9^...^9" would be more efficient :) but it hardly matters too much). So how do I even refer to numbers larger than this? Well, Knuth came up with a new notation, he said "10^^100" would be a tower with 100 10s in it. Now we again have a concise description of this number. But again, you can always make a number which is too big for this notation and for any notation.
So the question is, what sort of notation could I use to "graph" the Goodstein numbers? I cannot use scientific notation, because they grow far faster than that, I cannot even use any tower(k) notation. I cannot even use Knuth's up-arrow notation. Goodstein numbers grow (much) faster than Ackermann's function and Ackermann grows faster than anything in up-arrow notation. Now try asking anyone to graph Ackermann and they will smile, it grows so fast, they do not know what to graph it against except itself or something just as foreign (like Knuth up-arrows). And if you cannot graph that, you have not chance at Goodstein. So I do not think that I can give you any visual intuition for how fast Goodstein grows, but I'd be happy to discuss it. Cheers, — sligocki (talk) 04:47, 10 January 2010 (UTC)[reply]

Bases

I agree with you that some of these are completely unnotable, but for people like Robo37 they're ALL in my userspace. 4 T C 13:55, 23 January 2010 (UTC)[reply]

I don't understand. Are you saying that you've copied them to your user subpages? Cheers, — sligocki (talk) 21:21, 23 January 2010 (UTC)[reply]
Yes. 4 T C 03:36, 24 January 2010 (UTC)[reply]

Template Merger Revert

I was the nominator for the merger, then I retracted it. That was my reason for the section's removal. If you want to dispute it, then you can leave it on. But my advice is to delete it.174.3.98.236 (talk) 05:09, 8 February 2010 (UTC)[reply]

User:Sligocki/hatnotes.js

Just curious, what is this? You created it back in November and never made the subpage with the explanation as to what it does. Ten Pound Hammer, his otters and a clue-bat • (Many otters • One bat • One hammer) 03:14, 28 March 2010 (UTC)[reply]

Hello Ten, as the comments say it converts several strange hatnote variants into standard templates (like about, redirect, etc.). For example, {{Otheruses3}} has a direct subset of the functionality of {{Otheruses}}, but has a more arcane name (In fact it is now a redirect). This is set up to run as part of my WP:auto ed script. Let me know if you have any more questions. Cheers, — sligocki (talk) 17:48, 28 March 2010 (UTC)[reply]

You are now a Reviewer

Hello. Your account has been granted the "reviewer" userright, allowing you to review other users' edits on certain flagged pages. Pending changes, also known as flagged protection, is currently undergoing a two-month trial scheduled to end 15 August 2010.

Reviewers can review edits made by users who are not autoconfirmed to articles placed under pending changes. Pending changes is applied to only a small number of articles, similarly to how semi-protection is applied but in a more controlled way for the trial. The list of articles with pending changes awaiting review is located at Special:OldReviewedPages.

When reviewing, edits should be accepted if they are not obvious vandalism or BLP violations, and not clearly problematic in light of the reason given for protection (see Wikipedia:Reviewing process). More detailed documentation and guidelines can be found here.

If you do not want this userright, you may ask any administrator to remove it for you at any time. Courcelles (talk) 17:55, 19 June 2010 (UTC)[reply]

Reverted Good Faith edit

I am a long-term wikipedia reader and anonymous Wiki Gnome, but only recently a bona-fide user-with-a-username, doing more "actual edits". I noticed you reverted an attempt I made to fix a link to a disambiguation page to point to its correct page (this is the diff of my edit]). Due to my lack of experience with that type of edit I will presume it was because I did it incorrectly(?), but having seen many other examples of such edits (not-reverted), I am a bit confused. Could you please explain to me what I should actually do instead of the edit I made, with regard to cases particularly like that one (i.e. [[title category]] -> changed to -> [[title (category)|title]])? I'm asking your advice after searching "best practise" advice pages with respect to that (very widespread) case, and only finding more generalised advice. Also, I posted this here rather than on the article's talk page because that talk-page is presently empty/unedited, despite the article having some history - which makes me believe no-one would be watching the talk-page to answer... --Donkeydonkeydonkeydonkey (talk) 15:51, 10 August 2010 (UTC)[reply]

Hi Donkey^4, Welcome to Wikipedia userdom! A number of people make edit's like yours, but there really isn't much reason to and it makes the pages more complicated. In fact, Wikipedia has specific guidelines against it: Wikipedia:NOTBROKEN, see also: Wikipedia:Pipe#When not to use. Feel free to contact me for any more questions. Cheers, — sligocki (talk) 03:45, 11 August 2010 (UTC)[reply]
That was exactly the info I was looking for. Thanks :-) — Donkeydonkeydonkeydonkey (talk) 09:07, 11 August 2010 (UTC)[reply]

Busy Beaver (2,3)

I also did not yet know this paper of Lafitte and Papazian up to now, but Pascal Michel obviously knew it, already: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.104.3021&rep=rep1&type=pdf#page=231 . I take it as a published proof. Do you object? --H.Marxen (talk) 17:15, 3 September 2010 (UTC)[reply]

Sorry, after really studying their paper, I have to object myself: they stay informal, and so the case is not yet completely settled. I'll write more in Talk:Busy beaver. --H.Marxen (talk) 11:44, 4 September 2010 (UTC)[reply]

Proposed deletion of List of philosophers and scientists

Due to a previous prod that was contested in August 2008, List of philosophers and scientists cannot be deleted via prod. I have opened an AfD; see Wikipedia:Articles for deletion/List of philosophers and scientists. —KuyaBriBriTalk 17:55, 17 September 2010 (UTC)[reply]

Thanks Kuyabribri. — sligocki (talk) 00:56, 19 September 2010 (UTC)[reply]

Most vexing parse, GCC error

Re http://en.wikipedia.org/w/index.php?title=Most_vexing_parse&diff=prev&oldid=388374321

I'm aware that this is a verbatim copy of GCC output. But that verbatim output has a known bug. A type specifier void()() specifies the illegal type of a function that returns a function of type void(). The correct type of a function void f(); is void() (transferred to the concrete types in that example) and the type of a pointer to it is void(*)(). But type void()() is nonsense.

I see two possibilities we have here

  • Fix that error (the way I did) and provide a foot-note explaining that the output is not verbatimly copied, possibly even providing a link to a GCC bug-report if we find it.
  • Remove that GCC diagnostic (and possibly put clang's complete diagnostic).

I believe it is not good to put a diagnostic that displays the wrong types into wikipedia. The reader probably is confused enough if he ends up reading about "Most vexing parse" :) 87.154.138.164 (talk) 14:49, 4 October 2010 (UTC)[reply]

I tried it on my system, and at least GCC 4.5.1 does not display the wrong type anymore. So I'm not even convinced we need to tell anything about verbatim output. Just fixing it seems sufficient to me. 87.154.138.164 (talk) 15:10, 4 October 2010 (UTC)[reply]
OK, sounds good to me. I didn't realize it was a bug, I thought that gcc just expressed types in non-standard ways. Mostly, I just think that the error should be verbatum from somewhere and not doctored to "look right". Thanks for checking with gcc 4.5. — sligocki (talk) 05:22, 5 October 2010 (UTC)[reply]

Base 36, etc

Hi "base 26, base 62 seem to claim notability because there are 26 letters in our alphabet ..."

Base 36 was for the same reason, and I was really happy to find it. After that, I wanted the same table for Base 62, but it wasn't there.

I.e. 

0-9 = 10  10
a-z = 26   36
A-Z = 26   62

It would be fine if we may base 26, base 36, and base 62 into a single page that described bases that are used due to the roman A-Z.

Cheers Leo —Preceding unsigned comment added by Leodalord (talk • contribs) 13:58, 11 November 2010 (UTC)[reply]

Ehh. Base 36 is mostly notable as a coded form of senary. Its alphanumeric use has caused further use as indexing. Other than that, nothing. Would call it marginally notable. Double sharp (talk) 16:38, 26 October 2013 (UTC)[reply]

Willingly agreed

I have redirected this to Acceptance (disambiguation). Bearian (talk) 23:25, 15 November 2010 (UTC)[reply]

Lincoln Park

Hi, after a number of page moves I have started a requested move to seek consensus regarding the location of the page on the park in Chicago called Lincoln Park. As you have previously moved this page, I thought that you might like to contribute to the discussion at Talk:Lincoln Park (Chicago park). Thanks, —Jeremy (talk) 20:54, 24 December 2010 (UTC)[reply]

Nomination for merging of Template:Section template list

Template:Section template list has been nominated for merging with Template:Hatnote templates documentation. You are invited to comment on the discussion at the template's entry on the Templates for discussion page. Thank you. -DePiep (talk) 21:25, 23 January 2011 (UTC)[reply]

Articles you might like to edit, from SuggestBot

SuggestBot predicts that you will enjoy editing some of these articles. Have fun!

Stubs
Base 30
Ginjer Buchanan
America Alone
Journal of Bisexuality
Chris Lattner
Times Higher Education
Zealand
Asia-Pacific
2004 Commonwealth Youth Games
RubyGems
Catherine Seipp
American Institute of Bisexuality
Aegean numerals
Color gradient
Bisexuality in the Arab world
Periwinkle (color)
VHSIC
Bay Area Bisexual Network
The Bisexual Option
Cleanup
2010 Thai political protests
Kyrgyzstan
People's Alliance for Democracy
Merge
Kolmogorov complexity
Hindu–Arabic numeral system
Bioelectromagnetism
Add Sources
Goodstein's theorem
Visa requirements for Turkish citizens
New York Area Bisexual Network
Wikify
Lyrical dance
List of California Institute of Technology buildings and facilities
Youth Pride Chorus
Expand
Sexuality and gender identity-based cultures
LGBT rights in Luxembourg
United Kingdom local elections, 2007/District councils

SuggestBot picks articles in a number of ways based on other articles you've edited, including straight text similarity, following wikilinks, and matching your editing patterns against those of other Wikipedians. It tries to recommend only articles that other Wikipedians have marked as needing work. Your contributions make Wikipedia better — thanks for helping.

If you have feedback on how to make SuggestBot better, please tell me on SuggestBot's talk page. Thanks from Nettrom (talk), SuggestBot's caretaker.

P.S. You received these suggestions because your name was listed on the SuggestBot request page. If this was in error, sorry about the confusion. -- SuggestBot (talk) 16:12, 2 March 2011 (UTC)[reply]

The discusion on the merge of Super-logarithm and Super-root to Tetration has been forwarded to Wikipedia:Dispute resolution noticeboard#Merge of Super-logarithm and Super-root to Tetration and your name has been listed as part of the discusion

Feel free to join in with the discusion. Robo37 (talk) 20:15, 13 August 2011 (UTC)[reply]

Thanks for letting me know, Robo37. Is this a discussion for me to participate in, or have you just submitted this summary and some arbiter will come to a conclusion about it? In other words, should I express my opinions somewhere or simply wait? Cheers, — sligocki (talk) 20:28, 13 August 2011 (UTC)[reply]
I have not been involved with the dispute resolution noticeboard before so I'm not entirely at home with how it works but my general understanding is that it's a place for both. Robo37 (talk) 20:50, 13 August 2011 (UTC)[reply]

Provably Computable Functions and the Fast Growing Hierarchy

I got to browsing a little on your User Page, and found one of your "Paper's I'd like to get ahold of": Provably Computable Functions and the Fast Growing Hierarchy. Regards, HMman (talk) 01:32, 13 February 2012 (UTC)[reply]

Base 30

Hello sligocki,

Base 30 has been deleted for non-notability per AfD. Regards, Tyranitar Man (talk) 10:04, 13 September 2012 (UTC)[reply]

Good to hear, there were a lot of non-notable base articles out there for a while. Thanks, — sligocki (talk) 17:22, 13 September 2012 (UTC)[reply]

Global Positioning System

Sligocki, before removing valuable explanation of the "Basic concept of GPS" let's debate ii on the GPS talk page. RHB100 (talk) 00:13, 21 September 2012 (UTC)[reply]

sligocki, If you think you know of a more elegant or clear method to explain the fundamental concepts of how GPS works, then let's discuss it on the GPS talk page. I like more elegant and clear explanations. RHB100 (talk) 04:21, 21 September 2012 (UTC)[reply]

7-color, 2-state busy beaver

Hi, Sligocki.

I've heard that your Turing machines in the busy beaver game are record holders. Are you still finding these holders? How about 7-color, 2-state record holder? 31.42.233.14 (talk) 15:19, 22 August 2013 (UTC)[reply]

I have not investigated any 2x7 machines, as you can see in Busy beaver#Exact values and lower bounds for some S(n, m) and Σ(n, m), the 2x6 record holder already runs for 10^9866 steps and I suspect this is nowhere near the actual limit. Therefor I think there is much left for discovery even for smaller machines. What is your specific interest in 2x7 machines? Cheers, — sligocki (talk) 21:12, 22 August 2013 (UTC)[reply]
Well, there is no particular interest in namely 2x7 TMs, but I just noted that, in the last years, not much work has been done on this subject. According to this source, the last record has been setted back in 2010. 31.42.233.14 (talk) 08:51, 24 August 2013 (UTC)[reply]
You're right, I have not done much Busy Beaver work lately. The latest work I've heard of were Pavel's discoveries in 2010. It'd be nice to get back into this, but life is full of so many things to do :) Cheers, — sligocki (talk) 14:26, 29 August 2013 (UTC)[reply]

bases redux

Hi, here's what I think (sexagesimalist speaking):

  • Bases 1, 2, 3, 4, 5 and 6 are clearly notable, the 1–4 and 6 for mathematical use, and 5 mostly for lots of historical use. In particular 6 has been suggested for general use a few times.
  • I would keep bases 7, 9, 11, 13 for an unbroken initial series. We are still in the small prime numbers range here, so these bases benefit mathematically from their neighbours (I think I can find cites for that), so you get 1/2 = 0.555... in base 11, 1/3 = 0.282828..., 1/4 = 0.191919..., 1/5 = 0.222... Also there is cultural usage. And 11 was jokingly suggested by someone during the French Revolution, right? (lousy argument)
  • Base 10 is obviously notable. We use it, after all...
  • Bases 8, 12, and 16 have often been suggested for general use. Keep.
  • Bases 14 and 15. Mathematically they are interesting (they benefit from each other). But they are hardly used.
  • Bases 18 and 20 are only notable if at all for Mayan usage, 20 much more so. Our initial series of 1–16 is over, so no need: 17 and 19 do not benefit much mathematically from their neighbours which was just about the last argument going for them.
  • Higher bases: I would argue that the only really notable ones are 36 (alphanumeric), 60 (Babylonian) and 120 (Germanic). These are not only interesting culturally, but also mathematically.

So would say: strong keep for 1–6, 8, 10, 12, 16, 20, 60, 120 (create it). Marginal keep for 7, 9, 11, 13, 14, 15, 18, 36. Delete everything else. Double sharp (talk) 16:23, 26 October 2013 (UTC)[reply]

Hi Double sharp. I'm not very involved in the notability debates for base N. For the record, here's my opinion: we should keep very few base N articles, for example, definitely: Decimal, Binary number, Unary numeral system. Probably: Hexidecimal, Ternary numeral system, maybe: base 12. And the rest should be lumped into a single article about other bases. The reason here is that previously we've had too many articles with very little content, maybe only original research or speculation (for example, your suggestion for why 7, 9, 11, 13 should be kept) and often lots of overlapping boilerplate. Most of these pages will never be visited and the content will be spotty, stale and easily vandalized. I think this would be much better handled by a single article (something like base N) which covered all these speculative bases. That would be more likely for people to find, read, fix vandalism, keep in sync, etc.
Unfortunately, I found that this discussion process was too long and complicated to put effort into and in the end I kind of felt like I was stifling the folks who get really excited about contributing to an article on, say base 7. So I'm not invested much here. If you want to re-organize articles, go for it. I'd probably even write a little note if you let me know about an ongoing discussion, but I don't feel as strongly as a used to. If you want more info about my opinions on this: Category talk:Positional numeral systems#Notability is a good summary. Cheers, — sligocki (talk) 18:06, 27 October 2013 (UTC)[reply]
I think mathematically Base 30 is the most notable base. If you're speaking strictly about restricting repeating digits, being primorial, 30 is the best choice seeing as it's the lowest to show the first 6 unit factions finitely. I say the best choice because the next primorial base is base 210, which would have an impractical number of digits to work with. It's also been used for real in the Natural Area Code in setting latitude and longitude coordinates. Also it's used in Iberian astronomy, apparently. Robo37 (talk) 22:28, 17 March 2014 (UTC)[reply]

Welcome to The Wikipedia Adventure!

Hi Sligocki! We're so happy you wanted to play to learn, as a friendly and fun way to get into our community and mission. I think these links might be helpful to you as you get started.

-- 19:23, Friday, October 23, 2015 (UTC)

Mission 1 Mission 2 Mission 3 Mission 4 Mission 5 Mission 6 Mission 7
Say Hello to the World An Invitation to Earth Small Changes, Big Impact The Neutral Point of View The Veil of Verifiability The Civility Code Looking Good Together

ArbCom elections are now open!

Hi,
You appear to be eligible to vote in the current Arbitration Committee election. The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to enact binding solutions for disputes between editors, primarily related to serious behavioural issues that the community has been unable to resolve. This includes the ability 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, you are welcome to review the candidates' statements and submit your choices on the voting page. For the Election committee, MediaWiki message delivery (talk) 12:54, 23 November 2015 (UTC)[reply]

Median of medians with O(1) auxiliary space?

The Median of medians infobox says O(1) auxiliary space, but the implementation shown there takes O(log n) due to the recursion, and I don't see how to actually implement it with O(1). Web and books didn't help. So I tracked that infobox back as far as I could, to you adding that infobox here. Can you provide some reference? StefanPochmann (talk) 00:58, 3 January 2016 (UTC)[reply]

No memory of that edit from 6 years ago. I don't remember anything about this algorithm, so I was probably just researching it at the time and made a mistake. — sligocki (talk) 06:10, 3 January 2016 (UTC)[reply]
Ok, thank you. There's also a current SO question with 10 upvotes and no answer. So I also suspect it's a mistake, and I'd like to fix it. But I'm inexperienced here. Should I just change it to "O(log n)", or add a "citation needed" to the "O(1)"? StefanPochmann (talk) 23:40, 3 January 2016 (UTC)[reply]
Yes, go ahead and change it if you think it's wrong. WP:BOLD has more info, but the gist is: if you see a mistake, be bold and fix it :) At least that was the philosophy back when I was actively editing and it appears to still be. — sligocki (talk) 05:23, 4 January 2016 (UTC)[reply]

ArbCom Elections 2016: Voting now open!

Hello, Sligocki. 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. Mdann52 (talk) 22:08, 21 November 2016 (UTC)[reply]

oops, Supreme Court

Was reading stuff and didn't realize I was at the wrong page. Sorry. Of course, it was corrected in 3 minutes. Samswik (talk) 03:26, 1 February 2017 (UTC)[reply]

ArbCom 2017 election voter message

Hello, Sligocki. Voting in the 2017 Arbitration Committee elections is now open until 23.59 on Sunday, 10 December. All users who registered an account before Saturday, 28 October 2017, made at least 150 mainspace edits before Wednesday, 1 November 2017 and are not currently blocked are eligible 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 2017 election, please review the candidates and submit your choices on the voting page. MediaWiki message delivery (talk) 18:42, 3 December 2017 (UTC)[reply]

Osaka Municipal Subway logo replacement

Effective 1 April 2018, the Osaka Municipal Transportation Bureau will be replaced by Osaka Rapid Electric Tramway KK, which will be known as Osaka Metro. The logo that you uploaded will need to be replaced. J4lambert (talk) 14:32, 3 February 2018 (UTC)[reply]

Hi. Thank you for your recent edits. An automated process has detected that when you recently edited Ligocki, you added a link pointing to the disambiguation page Ligota (check to confirm | fix with Dab solver). 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) 09:22, 26 August 2018 (UTC)[reply]

ArbCom 2018 election voter message

Hello, Sligocki. Voting in the 2018 Arbitration Committee elections is now open until 23.59 on Sunday, 3 December. All users who registered an account before Sunday, 28 October 2018, made at least 150 mainspace edits before Thursday, 1 November 2018 and are not currently blocked are eligible 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 2018 election, please review the candidates and submit your choices on the voting page. MediaWiki message delivery (talk) 18:42, 19 November 2018 (UTC)[reply]

Edit filter false postiive

Sorry about that!! An edit filter was malfunctioning. I have fixed it. Your edit should go through now. Apologies! — MusikAnimal talk 05:19, 29 November 2018 (UTC)[reply]

ArbCom 2019 election voter message

Hello! Voting in the 2019 Arbitration Committee elections is now open until 23:59 on Monday, 2 December 2019. 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 2019 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 {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 00:04, 19 November 2019 (UTC)[reply]

ArbCom 2020 Elections voter message

Hello! Voting in the 2020 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 7 December 2020. 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 2020 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 {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 01:18, 24 November 2020 (UTC)[reply]

ArbCom 2021 Elections voter message

Hello! Voting in the 2021 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 6 December 2021. 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 2021 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 {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 00:06, 23 November 2021 (UTC)[reply]

ArbCom 2022 Elections voter message

Hello! Voting in the 2022 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 12 December 2022. 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 2022 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 {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 00:26, 29 November 2022 (UTC)[reply]

ArbCom 2023 Elections voter message

Hello! 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 {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 00:21, 28 November 2023 (UTC)[reply]

Two papers you would like to get ahold of

If you are still active on Wikipedia or read your talk page, here are two links to papers from User:Sligocki#Paper's_I'd_like_to_get_ahold_of:

  • Hardy, G.H. (1904), "A theorem concerning the infinite cardinal numbers": [5]
  • Buchholz, W., and Wainer, S.S (1987). "Provably Computable Functions and the Fast Growing Hierarchy": [6]

C7XWiki (talk) 05:53, 11 February 2024 (UTC)[reply]

Thanks. It's been a looong time since I was looking for these, but I appreciate you taking the time to share them! The fast-growing hierarchy has actually remained pretty relevant to me over time, so maybe it will be helpful to finally read these :) — sligocki (talk) 23:19, 11 February 2024 (UTC)[reply]

Proposed deletion of Setuptools

Notice

The article Setuptools has been proposed for deletion because of the following concern:

None of the included references appear to be significant coverage from a reliable source.

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 {{proposed deletion/dated}} notice, but please explain why in your edit summary or on the article's talk page.

Please consider improving the page 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. Just Step Sideways from this world ..... today 16:37, 30 June 2024 (UTC)[reply]

Nomination of Setuptools for deletion

A discussion is taking place as to whether the article Setuptools 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/Setuptools 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.

Just Step Sideways from this world ..... today 18:09, 5 July 2024 (UTC)[reply]

Hi. Thank you for your recent edits. An automated process has detected that when you recently edited Government of Rhode Island, you added a link pointing to the disambiguation page Governor's mansion. 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) 07:55, 31 August 2024 (UTC)[reply]

ArbCom 2024 Elections voter message

Hello! 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 {{NoACEMM}} to your user talk page. MediaWiki message delivery (talk) 00:07, 19 November 2024 (UTC)[reply]