Kolmogorov complexity and User talk:Nichalp/Archive21: Difference between pages

Add links
From Wikipedia, the free encyclopedia
(Difference between pages)
Content deleted Content added
VisualWikitext
Vivohobson (talk | contribs)
384 edits
→‎References: adding solomonoff papers
 
STBot (talk | contribs)
67,360 edits
substing deleted template, Replaced: {{User:Nichalp/sg}} → <font color="#0082B8">=Nichalp</font> <font color="#0082B8">«Talk»=</font> (5)
 
Line 1: Line 1:
== Barnstar ==
In [[algorithmic information theory]] (a subfield of [[computer science]]), the '''[[Andrey Kolmogorov|Kolmogorov]] complexity''' (also known as '''descriptive complexity''', '''Kolmogorov-Chaitin complexity''', '''stochastic complexity''', '''algorithmic entropy''', or '''program-size complexity''') of an object such as a piece of text is a measure of the [[computation]]al resources needed to specify the object. For example, consider the following two [[string (computer science)|strings]] of length 64, each containing only lowercase letters, numbers, and spaces:


abababababababababababababababababababababababababababababababab
4c1j5b2p0cv4w1 8rx2y39umgw5q85s7ur qbjfdppa0q7nieieqe9noc4cvafzf


Thanks ! [[User:Tintin1107|Tintin]] 13:22, 23 October 2005 (UTC)
The first string admits a short [[English language]] description, namely "ab 32 times", which consists of 11 characters. The second one has no obvious simple description (using the same character set) other than writing down the string itself, which has 64 characters.


== [[Boston, Massachusetts]] ==
[[Image:Mandelpart2.jpg|300px|right|thumb|This image illustrates part of the [[Mandelbrot set]] [[fractal]]. Simply storing the 24-bit color of each pixel in this image would require 1.62 million bits; but a small computer program can reproduce these 1.62 million bits using the definition of the Mandelbrot set. Thus, the Kolmogorov complexity of the raw file encoding this bitmap is much less than 1.62 million.]]


I am thinking of nominating this article for FA soon, but I need a final look before I proceed. Thanks. [[User:Pentawing|Pentawing]] 21:02, 23 October 2005 (UTC)
More formally, the [[complexity]] of a string is the length of the string's shortest description in some fixed [[Turing complete|universal]] [[description language]]. The sensitivity of complexity relative to the choice of description language is discussed below. It can be shown that the Kolmogorov complexity of any string cannot be too much larger than the length of the string itself. Strings whose Kolmogorov complexity is small relative to the string's size are not considered to be complex.
The notion of Kolmogorov complexity is surprisingly deep and can be used to state and prove impossibility results akin to [[Gödel's incompleteness theorem]] and [[halting problem|Turing's halting problem]].


==[[User:CambridgeBayWeather|CBW]] RfA==
== Definition==
Thank you for taking the time to vote on my RfA. If you have any concerns over my actions please let me know. Thanks [[User:CambridgeBayWeather|CambridgeBayWeather]] 23:04, 23 October 2005 (UTC)
To define Kolmogorov complexity, we must first specify a description language for strings. Such a description language can be based on a programming language such as [[Lisp programming language|Lisp]], [[Pascal (programming language)|Pascal]], or [[Java Virtual Machine]] bytecode. If '''P''' is a program which outputs a string ''x'', then '''P''' is a description of ''x''. The length of the description is just the length of '''P''' as a character string. In determining the length of '''P''', the lengths of any subroutines used in '''P''' must be accounted for. The length of any integer constant ''n'' which occurs in the program '''P''' is the number of bits required to represent ''n'', that is (roughly) log<sub>2</sub>''n''.


== Madhuri Mehta ==
We could alternatively choose an encoding for [[Turing machine]]s, where an ''encoding'' is a function which associates to each Turing Machine '''M''' a bitstring <'''M'''>. If '''M''' is a Turing Machine which on input ''w'' outputs string ''x'', then the concatenated string <'''M'''> ''w'' is a description of ''x''. For theoretical analysis, this approach is more suited for constructing detailed formal proofs and is generally preferred in the research literature. In this article we will use an informal approach.


Hello,
Any string ''s'' has at least one description, namely the program


I want to thank you personally for your acting with great decency when you re-attached my grandmother's article on my personal page, instead of deleting it.
'''function''' GenerateFixedString()
'''return''' ''s''


Nirav Maurya.
If a description of ''s'', ''d''(''s''), is of minimal length—i.e. it uses the fewest number of characters—it is called a '''minimal description''' of ''s''. Then the length of ''d''(''s'')—i.e. the number of characters in the description—is the '''Kolmogorov complexity''' of ''s'', written ''K''(''s''). Symbolically,


== SC Seal ==
:<math>K(s) = |d(s)|. \quad </math>


The image on the extreme left of http://supremecourtofindia.nic.in/title1g.gif seems to be a seal. I found textual references about a seal, but no images. --<small>[http://en.wikipedia.org/wiki/User:Pamri Pamri] &bull; [http://en.wikipedia.org/wiki/User_talk:Pamri Talk]</small> 02:52, 25 October 2005 (UTC)
We now consider how the choice of description language affects the value of ''K'' and show that the effect of changing the description language is bounded.


:Do you mean [[:Image:Justice12.jpg|this]]? From what I have read, it is choosen by the Chief Justice. So it may even change every year. --<small>[http://en.wikipedia.org/wiki/User:Pamri Pamri] &bull; [http://en.wikipedia.org/wiki/User_talk:Pamri Talk]</small> 14:41, 26 October 2005 (UTC)
'''Theorem'''. If ''K''<sub>1</sub> and ''K''<sub>2</sub> are the complexity functions relative to description languages ''L''<sub>1</sub> and ''L''<sub>2</sub>, then there is a constant ''c'' (which depends only on the languages ''L''<sub>1</sub> and ''L''<sub>2</sub>) such that
: <math>\forall s\ |K_1(s) - K_2(s)| \leq c, \quad </math>


:One lawyer I talked to today, suggestd using either the image in the URL I pasted above or the image of the Supreme Court below http://supremecourtofindia.nic.in/new_s/juris.htm
'''Proof'''. By symmetry, it suffices to prove that there is some constant ''c'' such that for all bitstrings ''s'',
--<small>[http://en.wikipedia.org/wiki/User:Pamri Pamri] &bull; [http://en.wikipedia.org/wiki/User_talk:Pamri Talk]</small> 18:22, 30 October 2005 (UTC)
: <math> K_1(s) \leq K_2(s) + c. </math>


== Renameuser function ==
To see why this is so, there is a program in the language ''L''<sub>1</sub> which acts as an [[interpreter (computing)|interpreter]] for ''L''<sub>2</sub>:


Hello,
'''function''' InterpretLanguage('''string''' ''p'')


You wrote on [[Wikipedia talk:Changing username]] that the renameuser function was disabled. Do you know where it's possible to have news about it ?
where ''p'' is a program in ''L''<sub>2</sub>. The interpreter is characterized by the following property:


:It was discussed in IRC, but the only place on WP is [http://en.wikipedia.org/wiki/Wikipedia:Wikipedia_Signpost/2005-09-26/News_and_notes here]. [[User:Nichalp|<font color="#0082B8">=Nichalp</font>]] [[User talk:Nichalp|<font color="#0082B8">«Talk»=</font>]] 15:38, 26 October 2005 (UTC)
: Running InterpretLanguage on input ''p'' returns the result of running ''p''.


== Happy Deepavali ==
Thus if '''P''' is a program in ''L''<sub>2</sub> which is a minimal description of ''s'', then InterpretLanguage('''P''') returns the string ''s''. The length of this description of ''s'' is the sum of
# The length of the program InterpretLanguage, which we can take to be the constant ''c''.
# The length of '''P''' which by definition is ''K''<sub>2</sub>(''s'').


Wish you and family Happy Deepavali.
This proves the desired upper bound.


--[[User:219.89.100.228|219.89.100.228]] 04:21, 26 October 2005 (UTC)
See also [[invariance theorem]].


:Thank you. :) [[User:Nichalp|<font color="#0082B8">=Nichalp</font>]] [[User talk:Nichalp|<font color="#0082B8">«Talk»=</font>]] 15:30, 26 October 2005 (UTC)
==History and context==
[[Algorithmic information theory]] is the area of computer science that studies Kolmogorov complexity and other complexity measures on strings (or other [[data structure]]s).


I wish you a happy Deepavali, too. [[User:Rickyrab|<nowiki></nowiki>]] &mdash; [[User:Rickyrab|Rickyrab]] | [[User talk:Rickyrab|Talk]] 20:11, 30 October 2005 (UTC)
Kolmogorov Complexity was first invented by [[Ray Solomonoff]] in 1960, who described it in "A Preliminary Report on a General Theory of Inductive Inference" (see ref) as a side product to his invention of [[Algorithmic probability | Algorithmic Probability]]. He gave a more complete description in his 1964 publications, "A Formal Theory of Inductive Inference," Part 1 and Part 2 in ''Information and Control'' (see ref).
:Sorry about the outburst, but Wikipedia is driving me NUTS with those auto-logouts that should NOT be occurring. Somebody oughta DO something about this problem. [[User:Rickyrab|<nowiki></nowiki>]] &mdash; [[User:Rickyrab|Rickyrab]] | [[User talk:Rickyrab|Talk]] 20:13, 30 October 2005 (UTC) [[User:Rickyrab|Rickyrab]] | [[User talk:Rickyrab|Talk]]


Thank you. :) [[User:Rickyrab|<nowiki></nowiki>]] &mdash; [[User:Rickyrab|Rickyrab]] | [[User talk:Rickyrab|Talk]] 11:23, 31 October 2005 (UTC)
[[Andrey Kolmogorov]] independently invented complexity as a measure of information content, first describing it in 1965, ''Problems Inform. Transmissions, 1,'' (1965), 1-7. [[Gregory Chaitin]] also invented it independently, submitting 2 reports on it in 1965, a preliminary investigation published in 1966 (''J. ACM,'' 13(1966) and a more complete discussion in 1969 (''J. ACM,'' 16(1969).


== Padma awardees ==
When Kolmogorov became aware of Solomonoff's work, he acknowledged Solomonoff's priority (IEEE Trans. Inform Theory, 14:5(1968), 662-664). For several years, Solomonoff's work was better known in the Soviet Union than in the Western World. The general consensus in the scientific community, however, was to associate this type of complexity with Kolmogorov, who was concerned with randomness
of a sequence while Algorithmic Probability became associated with Solomonoff, who focussed on prediction using his invention of the universal a priori probability distribution.


Hi Nichalp, hope you remember abt the discussion I had with you when you created the [[:Category:Padma Bhushan awardees]]. After your suggestion, I've gone ahead and created the other two categories to complete the set. The categories, Padma Vibhushan, Padma Bhushan and Padma Shri have been populated with 40+, 65+ and 100+ articles respectively. For most of the articles in the last category, it meant finding and entering the award information and then categorising it. btw, do u prefer Nicholas or is Nichalp ok? --[[User:Gurubrahma|Gurubrahma]] 18:26, 26 October 2005 (UTC)
There are several other variants of Kolmogorov complexity or algorithmic information. The most widely used one is based on self-delimiting programs and is mainly due to [[Leonid Levin]] (1974).


:Great! Both names are fine. [[User:Nichalp|<font color="#0082B8">=Nichalp</font>]] [[User talk:Nichalp|<font color="#0082B8">«Talk»=</font>]] 18:53, 26 October 2005 (UTC)
Axiomatic approach to Kolmogorov complexity based on [[Blum axioms]] (Blum 1967) was introduced by Mark Burgin in the paper presented for publication by [[Andrey Kolmogorov]] (Burgin 1982). Axiomatic approach to Kolmogorov complexity was further developed in the book (Burgin 2005) and applied to software metrics (Burgin and Debnath, 2003; Debnath and Burgin, 2003).


==Quick question==
Naming this concept "Kolmogorov complexity" is an example of the [[Matthew effect]].
Nichalp, a quick question: can any image that is found in a .gov website be uploaded? Thanks. [[User:Flcelloguy|Flcelloguy]] |<small> [[User talk:Flcelloguy|A <font color = brown> note? ]]</font color>| [[User:Flcelloguy/Desk|Desk]] </small>| [[Wikipedia:Signpost|W]]<sub>[[Wikipedia:Signpost|S]] </sub> 00:36, 27 October 2005 (UTC)
:Thanks. [[User:Flcelloguy|Flcelloguy]] |<small> [[User talk:Flcelloguy|A <font color = brown> note? ]]</font color>| [[User:Flcelloguy/Desk|Desk]] </small>| [[Wikipedia:Signpost|W]]<sub>[[Wikipedia:Signpost|S]] </sub> 21:42, 28 October 2005 (UTC)


==Basic results==
== RfA ==
In the following, we will fix one definition and simply write ''K''(''s'') for the complexity of the string ''s''.


Hi Nicholas,
It is not hard to see that the minimal description of a string cannot be too much larger than the string itself: the program GenerateFixedString above that outputs ''s'' is a fixed amount larger than ''s''.
Thanks for your lovely comments and your vote. I wasn't prepared for the public character assassination and general nastiness, and would never have agreed to the nomination had I known I'd be up for so much pain and embarrassment. It's turned WP from fun into distress, and has severely, and perhaps permanently, dented my enthusiasm for contributing. It's just not worth it.
Cheers and thanks again for your support.[[User:Tony1|Tony]] 06:52, 28 October 2005 (UTC)


== [[Rivers of India]] ==
'''Theorem'''. There is a constant ''c'' such that
:<math> \forall s \ K(s) \leq |s| + c. \quad </math>


Nicholas,<br>
=== Incomputability of Kolmogorov complexity ===
I've done a [http://en.wikipedia.org/w/index.php?title=Rivers_of_India&diff=26687087&oldid=26535676 major rewrite] of [[Rivers of India|this page]] and have subsequently created about a dozen articles related to it. Coments would be appreciated (if you have time). --[[User:Shreshth91|You know who sends you peer review requests]]


== Archiving of [[Wikipedia talk:Requests for adminship]] ==
The first result is that there is no way to effectively compute ''K''.


You archived several ongoing discussions on [[Wikipedia talk:Requests for adminship]] that had edits today and yesterday. I realize the page was getting long, but archiving ongoing conversations seems...a bit out of line. I respectfully request you reinstate the conversations that had comments today, and perhaps those with comments dated up to yesterday. --[[User:Durin|Durin]] 19:18, 28 October 2005 (UTC)
'''Theorem'''. ''K'' is not a [[computable function]].
*I was referring in general. I've archived the page once myself, but the metric I used was archiving through to the point where a subsection had not been commented on for at least three days. There's scalability problems here; the page by any metric is going to be well beyond 32kb by the time next year. --[[User:Durin|Durin]] 11:46, 29 October 2005 (UTC)


== [[User:Necrothesp|Necrothesp]] has set his email. ==
In other words, there is no program which takes a string ''s'' as input and produces the integer ''K''(''s'') as output. We show this by contradiction by making a program that creates a string that should only be able to be created by a longer program. Suppose there is a program


Just dropping you a note to let you know that [[User:Necrothesp|Necrothesp]] has set his email, per your request at [[Wikipedia:Requests for adminship/Necrothesp]]. Cheers! [[User:BD2412|<font style="background: lightgreen">&nbsp;BD2412</font>]] [[User talk:BD2412|<sup><b>talk</b></sup>]] 19:45, 28 October 2005 (UTC)
'''function''' KolmogorovComplexity('''string''' ''s'')


==Should I be an admin?==
that takes as input a string ''s'' and returns ''K''(''s''). Now consider the program
I noticed that I had admin powers now, but my RfA only had ~60% support. So did I get promoted by accident?--[[User:Shanel|Shanel]] 19:53, 28 October 2005 (UTC)


== [[Waterfall Gully, South Australia|Waterfall Gully]] ==
'''function''' GenerateComplexString('''int''' ''n'')
'''for''' i = 1 '''to''' infinity:
'''for each''' string s '''of''' length exactly i
'''if''' KolmogorovComplexity(''s'') >= ''n''
'''return''' ''s''
'''quit'''


I've made changes from the comments you gave, mind having another look and possibly expanding on what you've already said?
This program calls KolmogorovComplexity as a subroutine. This program tries every string, starting with the shortest, until it finds a string with complexity at least ''n'', then returns that string. Therefore, given any positive integer ''n'', it produces a string with Kolmogorov complexity at least as great as ''n''. The program itself has a fixed length ''U''. The input to the program GenerateComplexString is an integer ''n''; here, the size of ''n'' is measured by the number of bits required to represent ''n'' which is log<sub>2</sub>(''n''). Now consider the following program:
Cheers, - [[User:Michaelgabrielsen|michaelg]] 10:57, 29 October 2005 (UTC)


:You offered to draw a map for the suburb. Appropriate reference maps are [http://maps.msn.com/(0hgjalacvgzpxn45iubxphe2)/map.aspx?&lats1=-34.960&lons1=138.676&alts1=2&regn1=3&S=800,740 here], [http://www.whereis.com/whereis/mapping/zoomMap.do?mapIndex=2&brandId=1&level=3 here], [http://www.seo.sa.gov.au/apps/news/map.php?image=2002%2Felectorate403.gif here] and [http://www.id.com.au/burnside/commprofile/default.asp?id=139&gid=130&pg=1&bhcp=1 here].
'''function''' GenerateParadoxicalString()
:Cheers, - [[User:Michaelgabrielsen|michaelg]] 12:40, 29 October 2005 (UTC)
'''return''' GenerateComplexString(''n''<sub>0</sub>)


::[http://www.street-directory.com.au/sd_new/genmap.cgi?x=138.676&y=-34.960&sizex=800&sizey=800&level=5&enlarge=1&star=6 here's one for the outline of the suburb] and [http://pn2.whereis.com.au/gns/map0PCF0KWNTM6ZNHUE3.gif here's one in relation to the city center]. This [http://maps.msn.com/(l5w3gr45idncfk45w4rtbt45)/map.aspx?&lats1=-34.960&lons1=138.676&alts1=2&regn1=3&S=800,740 one] also might be useful!
This program calls GenerateComplexString as a subroutine and also has a free parameter
::Cheers, - [[User:Michaelgabrielsen|michaelg]] 13:11, 29 October 2005 (UTC)
''n''<sub>0</sub>. This program outputs a string ''s'' whose complexity is at least ''n''<sub>0</sub>. By an auspicious choice of the parameter ''n''<sub>0</sub> we will arrive at a contradiction. To choose this value, note ''s'' is described by the program GenerateParadoxicalString whose length is at most


:::I'll be thankful for what we get. We're lucky enough to have you offer to do it anyway!
:<math> U + \log_2(n_0) + C \quad </math>
:::Cheers, - [[User:Michaelgabrielsen|michaelg]] 13:30, 29 October 2005 (UTC)


::::I've changed a bit, to make it more accurate but great job! [[Image:Wgullymap fixes.png|400px]]
where ''C'' is the "overhead" added by the program GenerateParadoxicalString. Since ''n'' grows faster than log<sub>2</sub>(''n''), there exists a value ''n''<sub>0</sub> such that
::#I've made the green bit the CBD itself
:<math> U + \log_2(n_0) + C < n_0. \quad </math>
::#I didn't know your original fonts or anything so please be nice in regards to the changes!
But this contradicts the definition of having a complexity at least ''n''<sub>0</sub>. That is, by the definition of ''K''(''s''), the string ''s'' returned by GenerateParadoxicalString is only supposed to be able to be generated by a program of length ''n''<sub>0</sub> or longer, but GenerateParadoxicalString is shorter than ''n''<sub>0</sub>. Thus the program named "KolmogorovComplexity" cannot actually computably find the complexity of arbitrary strings.
::#Just hoping you could neaten it up so everything is standard as before.
::#By the way, what program/s did you use to create this?
::#Thanks!


:::Cheers, - [[User:Michaelgabrielsen|michaelg]] 01:01, 30 October 2005 (UTC)
This is proof by contradiction where the contradiction is similar to the [[Berry paradox]]: "Let ''n'' be the smallest positive integer that cannot be defined in fewer than twenty English words." It is also possible to show the uncomputability of K by reduction from the uncomputability of the [[halting problem]] H, since K and H are [[turing degree|Turing-equivalent]]. [http://www.daimi.au.dk/~bromille/DC05/Kolmogorov.pdf]
::::Delete any of the ones up to my final one, and if your final one is better, delete my final one too. - [[User:michaelgabrielsen|michaelg]] | [[User_talk:michaelgabrielsen|talk]] 08:36, 30 October 2005 (UTC)
:::::Justa sec, can you link me to your new image first before deleting Adel wgully map.png? Kill the other one. Cheers, - [[User:michaelgabrielsen|>>michaelg]] | [[User_talk:michaelgabrielsen|talk]] 11:28, 30 October 2005 (UTC)
::::::Hate to be picky, but you've labelled what is Greenhill Road as "Yarrabee Road". Yarrabee is simply a small offshoot of Greenhill Road in the suburb of Greenhill. If you want to correct this, it'd be great. Other than that, big thanks for now supporting! Cheers, - [[User:michaelgabrielsen|>>michaelg]] | [[User_talk:michaelgabrielsen|talk]] 11:40, 30 October 2005 (UTC)


== Thank you ==
===Chain rule for Kolmogorov complexity===


[[Image:WikiThanks.png|left|Thanks!]]
{{main | Chain rule for Kolmogorov complexity}}
Thank you ever so much for promoting me! I know you're quite busy, so I appreciate you taking the time :-) [[User:Kirill Lokshin|Kirill Lokshin]] 12:53, 29 October 2005 (UTC)


== Bye ==
The chain rule for Kolmogorov complexity states that


Nicholas,
:<math> K(X,Y) = K(X) + K(Y|X) + O(\log(K(X,Y))).\quad</math>


It was nice to know you a little over the last few months. In my memory, I wonder whether you are willing to promote some changes to the current RfA system, which I (and others) have found traumatic. My suggestions are somewhere on that abusive page. [[User:Tony1|Tony]] 14:01, 29 October 2005 (UTC)
It states that the shortest program that reproduces ''X'' and ''Y'' is [[Big-O notation|no more]] than a logarithmic term larger than a program to reproduce ''X'' and a program to reproduce ''Y'' given ''X''. Using this statement one can define [[Mutual information#Absolute mutual information|an analogue of mutual information for Kolmogorov complexity]].


I ''do'' take it personally; looks like you're not prepared to do anything about it. [[User:Tony1|Tony]] 19:41, 29 October 2005 (UTC)
== Compression ==
It is however straightforward to compute upper bounds for ''K''(''s''): simply [[data compression|compress]] the string ''s'' with some method, implement the corresponding decompressor in the chosen language, concatenate the decompressor to the compressed string, and measure the resulting string's length.


== Adminship ==
A string ''s'' is compressible by a number ''c'' if it has a description whose length does not exceed |''s''| &minus; ''c''. This is equivalent to saying <span style="white-space:nowrap">''K''(''s'') ≤ |''s''| &minus; ''c''</span>. Otherwise ''s'' is incompressible by ''c''. A string incompressible by 1 is said to be simply ''incompressible''; by the [[pigeonhole principle]], incompressible strings must exist, since there are 2<sup>''n''</sup> bit strings of length ''n'' but only <span style="white-space:nowrap">2<sup>''n''</sup>&minus;2</span> shorter strings, that is strings of length ''n''&nbsp;&minus;&nbsp;1 or less.


Thanks Nick, but not in the immediate future. [[User:Tintin1107|Tintin]] 19:06, 29 October 2005 (UTC)
For the same reason, "most" strings are complex in the sense that they cannot be significantly compressed: ''K''(''s'') is not much smaller than |''s''|, the length of ''s'' in bits. To make this precise, fix a value of ''n''. There are 2<sup>''n''</sup> bitstrings of length ''n''. The [[Uniform distribution (discrete)|uniform]] [[probability]] distribution on the space of these bitstrings assigns to each string of length exactly ''n'' equal weight 2<sup>&minus;''n''</sup>.


:I would. Thanks for asking. --<small>[http://en.wikipedia.org/wiki/User:Pamri Pamri] &bull; [http://en.wikipedia.org/wiki/User_talk:Pamri Talk]</small> 03:54, 30 October 2005 (UTC)
'''Theorem'''. With the uniform probability distribution on the space of bitstrings of length ''n'', the probability that a string is incompressible by ''c'' is at least <span style="white-space:nowrap">1 &minus; 2<sup>&minus;''c''+1 </sup> + 2<sup>&minus;''n''</sup></span>.


:Yes sir..I have finished the formalities. Thanks for trusting and nominating me. --<small>[http://en.wikipedia.org/wiki/User:Pamri Pamri] &bull; [http://en.wikipedia.org/wiki/User_talk:Pamri Talk]</small> 17:06, 30 October 2005 (UTC)
To prove the theorem, note that the number of descriptions of length not exceeding <span style="white-space:nowrap">''n'' &minus; ''c''</span> is given by the [[geometric series]]:


== Congrats ==
:<math> 1 + 2 + 2^2 + \cdots + 2^{n-c} = 2^{n-c+1}-1.\quad </math>


Thanks for your congrats on my adminship! --[[User:Edcolins|Edcolins]] 20:04, 29 October 2005 (UTC)
There remain at least


== Template:PD-IndiaGov ==
:<math> 2^n-2^{n-c+1}+1 \quad </math>


[[User:Eugene van der Pijll]] claims that the [[Right to Information Act]] is only a [[FOIA]]-type act, and does not put Indian government publications in the public domain at all. The User has bought up the matter at [[Wikipedia talk:Copyright problems]]. Since the template [http://commons.wikimedia.org/wiki/Template:PD-IndiaGov PD-IndiaGov] was initially created by you in Wikimedia Commons, I hope that you would look into the matter and resolve the dispute. --[[User:Deepak gupta|Deepak]]|[[User talk:Deepak gupta|वार्ता]] 17:34, 30 October 2005 (UTC)
many bitstrings of length ''n'' that are incompressible by ''c''. To determine the probability divide by 2<sup>''n''</sup>.


:Done posting to the list. Are you subscribed to it? --<small>[http://en.wikipedia.org/wiki/User:Pamri Pamri] &bull; [http://en.wikipedia.org/wiki/User_talk:Pamri Talk]</small> 07:23, 1 November 2005 (UTC)
This theorem is the justification for various challenges in [http://www.faqs.org/faqs/compression-faq/part1/ comp.compression FAQ]. Despite this result, it is sometimes claimed by certain individuals (considered [[Crank (person)|cranks]]) that they have produced algorithms which uniformly compress data without loss. See [[lossless data compression]].


:Thanks and wish you the same. If you can't recieve the mails, ping me & I will forward it to you. --<small>[http://en.wikipedia.org/wiki/User:Pamri Pamri] &bull; [http://en.wikipedia.org/wiki/User_talk:Pamri Talk]</small> 07:31, 1 November 2005 (UTC)
==Chaitin's incompleteness theorem ==
We know that most strings are complex in the sense that they cannot be described in any significantly "compressed" way. However, it turns out that the fact that a specific string is complex cannot be formally proved, if the string's length is above a certain threshold. The precise formalization is as follows. First fix a particular [[axiomatic system]] '''S''' for the [[natural number]]s. The axiomatic system has to be powerful enough so that to certain assertions '''A''' about complexity of strings one can associate a formula '''F'''<sub>'''A'''</sub> in '''S'''. This association must have the following property: if '''F'''<sub>'''A'''</sub> is provable from the axioms of '''S''', then the corresponding assertion '''A''' is true. This "formalization" can be achieved either by an artificial encoding such as a [[Gödel numbering]] or by a formalization which more clearly respects the intended interpretation of '''S'''.


== Editing Talk:Chennai (comment) ==
'''Theorem'''. There exists a constant ''L'' (which only depends on the particular axiomatic system and the choice of description language) such that there does not exist a string ''s'' for which the statement
: <math> K(s) \geq L \quad </math>
(as formalized in '''S''') can be proven within the axiomatic system '''S'''.


Please see the addition suggested on this talk page and opine.
Note that by the abundance of nearly incompressible strings, the vast majority of those statements must be true.


--[[User:Dore chakravarty|Dore chakravarty]] 23:29, 30 October 2005 (UTC)
The proof of this result is modeled on a self-referential construction used in [[Berry's paradox]]. The proof is by contradiction. If the theorem were false, then


== Map of the 17 provinces ==
:'''Assumption (X)''': For any integer ''n'' there exists a string ''s'' for which there is a proof in '''S''' of the formula "''K''(''s'') ≥ ''n''" (which we assume can be formalized in '''S''').


Dear Nicholas,
We can find an effective enumeration of all the formal proofs in '''S''' by some procedure


Yes it is true one could make a simpler map. I however personally think it is not that easy to make it better. You'll find many historical maps of the region at this time on the site:
'''function''' NthProof('''int''' ''n'')
which takes as input ''n'' and outputs some proof. This function
enumerates all proofs. Some of these are proofs for formulas we do not
care about here (examples of proofs which will be listed by the procedure NthProof are the various known proofs of the [[law of quadratic reciprocity]], those of [[Fermat's little theorem]] or the proof of [[Fermat's last theorem]] all translated into the formal language of '''S'''). Some of these are complexity formulas of the form ''K''(''s'') ≥ ''n'' where ''s'' and ''n'' are constants in the language of '''S'''. There is a program


http://www.zum.de/whkmla/histatlas/lowcountries/haxbelgium.html
'''function''' NthProofProvesComplexityFormula('''int''' ''n'')


One of the difficulty you're going to meet is that it is difficult to establish the exact border at an exact time. Those borders were not very stable depending on the alliances and wars with the neighbouring states. It is also difficult to know how to count the 17 provinces. Have a look at the article [[Seventeen Provinces]] and its discussion page for details about the controversy.
which determines whether the ''n''<sup>th</sup> proof actually proves
a complexity formula ''K''(''s'') ≥ ''L''. The strings ''s'' and
the integer ''L'' in turn are computable by programs:
'''function''' StringNthProof('''int''' ''n'')


I think what should appear clearly on the map is the following:
'''function''' ComplexityLowerBoundNthProof('''int''' ''n'')
*The internal borders in order to show that there is no border corresponding to the current Belgo-Netherlandish border
*A clear different color for the bishopric of Liege which does not belong to the 17 provinces


[[User:Vb|Vb]] 08:33, 31 October 2005 (UTC)
Consider the following program


== RFA end-date ==
'''function''' GenerateProvablyComplexString('''int''' ''n'')
'''for''' i = 1 to infinity:
'''if''' NthProofProvesComplexityFormula(i) '''and''' ComplexityLowerBoundNthProof(i) >= ''n''
'''return''' StringNthProof(''i'')
'''quit'''


Thanks for pointing out the stamping/formatting problem with my RFA end-time. I wasn't 100% sure if it was the 'done thing' for me to fix this, or to wait and see if the nominator would. And nor am I, entirely, about when the exact end-time ''should'' be -- practice seems to vary somewhat between nomination time, acceptance time, and listing time (+7d). Anyhoo, done now (and going with the conversative (and I think logical) listing-time interpretation). [[User:Alai|Alai]] 00:55, 1 November 2005 (UTC)
Given an ''n'', this program tries every proof until it finds a string
and a proof in the [[formal system]] '''S''' of the formula ''K''(''s'') ≥ ''L'' for some ''L'' >= ''n''. The program
terminates by our '''Assumption (X)'''. Now this program has a length ''U''.
There is an integer ''n''<sub>0</sub> such that ''U'' + log<sub>2</sub>(''n''<sub>0</sub>) + ''C'' < ''n''<sub>0</sub>, where ''C'' is the overhead cost of


== your message ==
'''function''' GenerateProvablyParadoxicalString()
'''return''' GenerateProvablyComplexString(''n''<sub>0</sub>)
'''quit'''


Nicholas,
The program GenerateProvablyParadoxicalString outputs a string ''s'' for which there exists an ''L'' such that ''K''(''s'') ≥ ''L'' can be formally proved in '''S''' with ''L'' >= ''n''<sub>0</sub>. In particular ''K''(''s'') ≥
I don't feel betrayed by you at all, and I've comprehended the points you made. The problem is that the RfA process ''does'' result in personal comments as it is currently framed, and provides no protection for any of the participants. I was just totally unaware that it would be like that, and would never have aggreed to it if I had been. If there's any further need to talk, please use the email facility. Best wishes too. [[User:Tony1|Tony]] 05:33, 1 November 2005 (UTC)
''n''<sub>0</sub> is true. However, ''s'' is also described by a program of length
''U''+log<sub>2</sub>(''n''<sub>0</sub>)+''C'' so its complexity is less than ''n''<sub>0</sub>. This contradiction proves '''Assumption (X)''' cannot hold.


Similar ideas are used to prove the properties of [[Chaitin's constant]].


The [[minimum message length]] principle of statistical and inductive inference and machine learning was developed by [[Chris Wallace (computer scientist)|C.S. Wallace]] and D.M. Boulton in 1968. MML is [[Bayesian probability|Bayesian]] (it incorporates prior beliefs) and
information-theoretic. It has the desirable properties of statistical
invariance (the inference transforms with a re-parametrisation, such as from
polar coordinates to Cartesian coordinates), statistical consistency (even
for very hard problems, MML will converge to any underlying model) and efficiency (the MML model will converge to any true underlying model about as quickly as is possible). [http://www.csse.monash.edu.au/~dld/CSWallacePublications/ C.S. Wallace] and D.L. Dowe showed a formal connection between MML and algorithmic information theory (or Kolmogorov complexity) in 1999.


== Happy Diwali!! ==
==Kolmogorov randomness==
''Kolmogorov randomness'' (also called ''algorithmic randomness'') defines a [[string (computer science)|string]] (usually of [[bit]]s) as being [[randomness|random]] if and only if it is shorter than any [[computer program]] that can produce that string. This definition of randomness is critically dependent on the definition of Kolmogorov complexity. To make this definition complete, a computer has to be specified, usually a [[Turing machine]]. According to the above definition of randomness, a random string is also an "incompressible" string, in the sense that it is impossible to give a representation of the string using a program whose length is shorter than the length of the string itself. However, according to this definition, most strings shorter than a certain length end up to be (Chaitin-Kolmogorovically) random because the best one can do with very small strings is to write a program that simply prints these strings.


[[Image:Diwali.jpg|thumb|right|Happy Diwali!]]
==See also==
*[[Berlekamp-Massey algorithm]]
*[[Data compression]]
*[[List of important publications in computer science#algorithmic information theory|Important publications in algorithmic information theory]]
*[[Levenshtein distance]]


Happy Diwali to you!!--May the Force be with you! [[User:Shreshth91|Shreshth91]]<small>[[User talk:Shreshth91|<font color=green>($ |-| r 3 $ |-| t |-|)</font>]]</small> 08:04, 1 November 2005 (UTC)
== References ==
:No articles to review, but you should check this out:
{{India tasks}}--May the Force be with you! [[User:Shreshth91|Shreshth91]]<small>[[User talk:Shreshth91|<font color=green>($ |-| r 3 $ |-| t |-|)</font>]]</small> 08:19, 1 November 2005 (UTC)


==Question==
*Blum, M. (1967) On the Size of Machines, ''Information and Control'', v. 11, pp. 257-265
Hi, thanks for you vote on the Canberra FAC. In reponse to your question, I like to let my articles sit around for a month or two to mature before I nominate them, that way I'm satisfied them and then there are no major changes to make when FAC come around. Since you're a bit of a Wiki wiz, I was wondering if you know how to add optional fields to templates. We need to know for [[Template:Infobox Australian City]], help, if you know how, would be appreciated.--[[User:Petaholmes|nixie]] 10:27, 1 November 2005 (UTC)
* Burgin, M. (1982) Generalized Kolmogorov complexity and duality in theory of computations, Notices of the Russian Academy of Sciences, v.25, No. 3, pp.19-23
* Mark Burgin (2005), ''Super-recursive algorithms'', Monographs in computer science, Springer.
* Burgin, M. and Debnath, N. Hardship of Program Utilization and User-Friendly Software, in ''Proceedings of the International Conference “Computer Applications in Industry and Engineering”'', Las Vegas, Nevada, 2003, pp. 314-317
* Thomas M. Cover, Joy A. Thomas. ''Elements of information theory'', 1st Edition. New York: Wiley-Interscience, 1991. ISBN 0-471-06259-6.
:2nd Edition. New York: Wiley-Interscience, 2006. ISBN 0-471-24195-4.
* Debnath, N.C. and Burgin, M., (2003) Software Metrics from the Algorithmic Perspective, in ''Proceedings of the ISCA 18th International Conference “Computers and their Applications”'', Honolulu, Hawaii, pp. 279-282
* Rónyai Lajos, Ivanyos Gábor, Szabó Réka, ''Algoritmusok''. TypoTeX, 1999.
* Solomonoff, Ray, A Preliminary Report on a General Theory of Inductive Inference, Report V-131, Zator Co., Cambridge, Ma. Feb 4, 1960. [http://world.std.com/~rjs/z138.pdf (pdf version)].
* Solomonoff, Ray, A Formal Theory of Inductive Inference, ''Information and Control'', Part I, Vol 7, No. 1 pp 1-22, March 1964, [http://world.std.com/~rjs/1964pt1.pdf (pdf version)] and Part II, Vol 7, No. 2 pp 224-254, June 1964. [http://world.std.com/~rjs/1964pt2.pdf (pdf version)].


:We want to add several optional parameters to [[Template:Infobox Australian City]], including one for government (governemnt arrangements vary widely between Australia cities ) and on for the flag and crest (some cities don't have one). I got some instructions from SEWilco, but I really need to see it in practice to know how to do it myself.--[[User:Petaholmes|nixie]] 01:17, 2 November 2005 (UTC)
* Ming Li and Paul Vitányi, ''An Introduction to Kolmogorov Complexity and Its Applications'', Springer, 1997. [http://citeseer.ist.psu.edu/li97introduction.html Introduction chapter full-text].
* Yu Manin, ''A Course in Mathematical Logic'', Springer-Verlag, 1977.
* Michael Sipser, ''Introduction to the Theory of Computation'', PWS Publishing Company, 1997.


==External links==
== Photos ==
* [http://www.kolmogorov.com/ The Legacy of Andrei Nikolaevich Kolmogorov]
* [http://www.cs.umaine.edu/~chaitin/ Chaitin's online publications]
* [http://www.idsia.ch/~juergen/ray.html Solomonoff's IDSIA page]
* [http://www.idsia.ch/~juergen/kolmogorov.html Generalizations of algorithmic information] by [[Juergen Schmidhuber|J. Schmidhuber]]
* [http://homepages.cwi.nl/~paulv/kolmogorov.html Ming Li and Paul Vitanyi, An Introduction to Kolmogorov Complexity and Its Applications, 2nd Edition, Springer Verlag, 1997.]
* [http://homepages.cwi.nl/~tromp/cl/cl.html Tromp's lambda calculus computer model offers a concrete definition of K()]
* Universal AI based on Kolmogorov Complexity ISBN 3-540-22139-5 by [[Marcus Hutter|M. Hutter]]: ISBN 3-540-22139-5
* [http://www3.oup.co.uk/computer_journal/hdb/Volume_42/Issue_04/pdf/420270.pdf Minimum Message Length and Kolmogorov Complexity] (by [http://www.csse.monash.edu.au/~dld/CSWallacePublications C.S. Wallace] and [http://www.csse.monash.edu.au/~dld D.L. Dowe], Computer Journal, Vol. 42, No. 4, 1999).
* [http://www.csse.monash.edu.au/~dld David Dowe]'s [http://www.csse.monash.edu.au/~dld/MML.html Minimum Message Length (MML)] and [http://www.csse.monash.edu.au/~dld/Occam.html Occam's razor] pages.
* P. Grunwald, M. A. Pitt and I. J. Myung (ed.), [http://mitpress.mit.edu/catalog/item/default.asp?sid=4C100C6F-2255-40FF-A2ED-02FC49FEBE7C&ttype=2&tid=10478 Advances in Minimum Description Length: Theory and Applications], M.I.T. Press, April 2005, ISBN 0-262-07262-9.


Hi Nichalp. Photos of an adult shoeshine boy, or boys, would be just as welcome, and would be a great aid in improving the article. Thanks! [[User:Proto|Proto]]<small>&nbsp;[[User_talk:Proto|t]]&nbsp;[[Special:Contributions/Proto|c]]</small> 13:30, 1 November 2005 (UTC)
{{Compression Methods}}
[[Category:Algorithmic information theory|*]]
[[Category:Information theory|*]]
[[Category:Recursion theory]]
[[Category:Theory of computation]]


== Project Cricket ==
[[de:Kolmogorow-Komplexität]]

[[fa:نظریه الگوریتمی اطلاعات]]
I'm willing to help with this project as much as possible, but i have looked through the article writing help thing, and i havn't got a chance of writing that confidently. I can help with recording some small videos and taking photos of bowling actions, and cricket grounds around the UK. I also ahve a few videos and images from test matches in England, and possibly one from a Gloucestershire County game. I can get a lot of county pictures during next summer, and also some Internationals, the England ones most likely.
[[fr:Complexité de Kolmogorov]]

[[gl:Complexidade de Kolmogorov]]
Cheers.
[[he:סיבוכיות קולמוגורוב]]
cc2003btw
[[ja:コルモゴロフ複雑性]]

[[pl:Złożoność Kołmogorowa]]
== Image:Des-1-KYM.jpg- copyrights ==
[[pt:Complexidade de Kolmogorov]]

[[ru:Колмогоровская сложность]]
Images in the web site maintained by a software company has allowed saving emailing etc. If so can the images not be considered as free from copyright laws by Wiki policies? Your opinion please. Another administrator (Thuresson 10:20, 1 November 2005 (UTC))has said that it is not allowed and will be deleted.
[[tr:Kolmogorov karmaşıklığı]]

[[zh:柯氏复杂性]]
Swathi Soft Solutions--Email is not getting connected for me to get clarification from them.

Details of web sites given here for information and check.

http://www.kym.org/tkrish.html

http://www.kym.org/tkvd.html

Above sites developed and maintained by

http://www.softsolutions.co.in/

--[[User:Dore chakravarty|Dore chakravarty]] 21:00, 1 November 2005 (UTC)

== Thanks for the wishes ==

Thanks for your wishes, and it really looks very odd on my part – to say you a happy diwali, after the event is over. However, we wikipedians can always celebrate the festival of light by doing something good here. --[[User:Bhadani|Bhadani]] 14:59, 2 November 2005 (UTC)

== [[Syed Mohammed Hadi]] ==

I came across the great grand-daughter of the man who scored the first hundred in Ranji trophy [[User_talk:Tintin1107#Syed_Mohammed_Hadi]] . I am thrilled ! [[User:Tintin1107|Tintin]] 16:20, 2 November 2005 (UTC)

== RFA ==

Hi! As you know, your RFA bid did not receive the required level of support and I had to fail it. This does not mean that you cannot be an admin, you can try again some other time and reflect on what went wrong in this RFA. Regards, [[User:Nichalp|<font color="#0082B8">=Nichalp</font>]] [[User talk:Nichalp|<font color="#0082B8">«Talk»=</font>]] 18:54, 2 November 2005 (UTC)
:Thank you for closing the vote and thank you for the advice. You followed established procedures and conventions, of course, and I can have no complaint. Just one minor thing I'm wondering about - did you discount exactly two support votes or did you just not update the counter? :) It's a trivial matter, of course, I'd just like to make sure that the archive is accurate. - [[User:Haukurth|Haukur Þorgeirsson]] 19:12, 2 November 2005 (UTC)
::Thanks! - [[User:Haukurth|Haukur Þorgeirsson]] 19:20, 2 November 2005 (UTC)

== Image:Des-1-KYM.jpg ==

Thanks for reply. Difficult to understand. Please '''opine''' '''for my future references only,'''
on the reply received from publisher, as under.
Received reply from relevant WEB publisher as under,
-------------------
----- Original Message -----
From: K S Sudhakar
To: marc_d@softhome.net ; solutions@swathigroup.com
Sent: Wednesday, November 02, 2005 10:47 PM
Subject: RE: Copyright-http://www.kym.org/contactus.html

'''The photographs used in KYM site are taken by the Executive trustee of KYM and he has permitted its usage for KYM website.'''

sudhakar
---------------------
Above information with the following data given with the uploading, does it satisfy the requirements of WIKI please?

'''Photo taken from web site: http://www.kym.org/tkvd.html and maintained by http://www.softsolutions.co.in/ which allows saving and emailing etc. No copy right is mentioned. Hence assumed no copyrights exist'''.
------------------------
--[[User:Dore chakravarty|Dore chakravarty]] 21:00, 2 November 2005 (UTC)

== Pseudo-RfC ==

Nichalp - Firstly how ''does'' one vocalise that? "Nee-Chulp"? "Nitch-alp"? Anyway. I've made a note that at the top that the nomination has failed. I've also asked that it be left open until roughly midnight, to allow for any extra input. As it's been very civil, cordial almost, I don't see the harm and I've drawn a lot of valuable input from the process. If, however, you're of the opinion that ''both'' no good can come of it ''and'' that damage will be done, show it the door. Unless you're looking for me to use the word "withdraw" to make it official? - [[User:Aaron Brenneman|<font color="#2f4f4f">brenneman</font>]][[User Talk:Aaron Brenneman|<font color="#2f4f4f"><sup>(t)</sup></font>]][[Special:Contributions/Aaron Brenneman|<font color="#2f4f4f"><sup>(c)</sup></font>]] 05:48, 3 November 2005 (UTC)
:Hi! I've removed your nomination. The problem is the pileon votes which will increase. RFA is the forum to ascertain the suitability of a candidate for adminship. For feedback, an RFC on yourself would be better. Having your nomination go on would be pointless IMHO, and unnecessarily increase the server load. Regards, PS I think the latter pronounciation would be fine. ''Nichalp'' is a combination of a few letters of my name, and surname. Regards, [[User:Nichalp|<font color="#0082B8">=Nichalp</font>]] [[User talk:Nichalp|<font color="#0082B8">«Talk»=</font>]] 06:01, 3 November 2005 (UTC)
:*Oh. All right then. I must be honest and say that seems, well, overly officious. I'm aware that an RfC would be the place had I been ''seeking'' feedback, but here I was trying to elicit ''more'' of what had been forthcoming. As to the "pile on" I'm not sure how that's a problem, as if they had brought points that I could improve that hadn't been touched yet, that would be the ''point''. Finally, server load... that leaves me gobsmacked. You've got a '''''templated sig'''''. I'm not fussed by the removal ''per se'' but, well, yeah. Gobsmacked. - [[User:Aaron Brenneman|<font color="#2f4f4f">brenneman</font>]][[User Talk:Aaron Brenneman|<font color="#2f4f4f"><sup>(t)</sup></font>]][[Special:Contributions/Aaron Brenneman|<font color="#2f4f4f"><sup>(c)</sup></font>]] 06:11, 3 November 2005 (UTC)
::*Ok, I promise to listen to you if you promise to listen to my explanation the templated signature, deal? <br/> [[User:Aaron Brenneman|<font color="#2f4f4f">brenneman</font>]][[User Talk:Aaron Brenneman|<font color="#2f4f4f"><sup>(t)</sup></font>]][[Special:Contributions/Aaron Brenneman|<font color="#2f4f4f"><sup>(c)</sup></font>]] 06:38, 3 November 2005 (UTC)
=== Template talk ===
This all comes with the caveat that I've not studied up on the mediawiki software at all, but all similar systems have some of the same underlying principles. Also I have no idea (not having done any homework on you) what you level of knowledge is. It's very wiki, because if I say something wrong, someone is sure to correct me!

Ok, when we type http:///en.wikipedia.org/wiki/foo into our browser of choice, three things happen. Ok, a lot more than three things happen, but we only care about three.
#The data is located
#The data is read
#It's processed to the screen

Each of these things take a certain amount of time and cycles. Location is independant of the size of the article, but reading and processing both scale.
So location, consisting of scanning the indicies and moving the read head to the correct location of the correct disk, takes 50 server "units" say. Reading the data and processing each take one server unit per kb. This is just made up, but you get the drift.

My RfA page was 400 Kb, for total of 850 server units to display ''if there is no transclusion''.

If there are <nowiki>{{}}</nowiki> on the page, it must perform another step. It goes and gets ''that'' page in exactly the same manner that it does a regular one. So a template that is 25 bytes takes 100 server units to display, ''in addition'' to whatever else must be displayed on the page.

Thus a page with 50 Kb plain and transcluding a 50 Kb template takes 150 units for the template and 150 for the plain text, 300 total. If the template had been converted into plain text via <nowiki>{{subst:}}</nowiki> it would have only taken 250 server units. That hypothetical fifty extra units is consumed every time someone refreshes (e.g. looks at) a page.

''Every'' time a page with you signature template is refreshed, ''anywhere''. 12658 edits, conservativly 75% have signatures, say only 50% of those on pages with any traffic, that's still a lot of refreshes. Or, if by removing my 400 Kb RfA you stopped it from being refreshed 100 times, you'd have saved 85,000 server units. If your 15 Kb sig was in only 100 places and each were refreshed the same 100 times, that's 800,000 server units or almost ten times the extra load placed on the box as you'd have saved. So that's why I got a bit shirty before, eh?

Of course, it is all much more complicated than that. Dynamic caching, incremental fetch, intelligent partitioning, it's a black art. But the basics are still true.

And what for? Use Preferences -> raw signatures, and never have to listen to guys like me whine again.

Thank you for indulging me!<br/>
[[User:Aaron Brenneman|<font color="#2f4f4f">brenneman</font>]][[User Talk:Aaron Brenneman|<font color="#2f4f4f"><sup>(t)</sup></font>]][[Special:Contributions/Aaron Brenneman|<font color="#2f4f4f"><sup>(c)</sup></font>]] 12:04, 3 November 2005 (UTC)

== Administrator ==

Just now I saw the list of Adm. and saw your name there indicating from 27 Sep 2004 (UTC).

I really appreciate your knowledge and interest and wish you all the success in your errand.

--[[User:Dore chakravarty|Dore chakravarty]] 06:26, 3 November 2005 (UTC)

== Thanks! ==

Thanks for hooking me up with the promotion on my RfA! I hope to do good by all who supported me. Thanks for your time! --[[User:Jeffrey O. Gustafson|Jeffrey O. Gustafson]] - ''[[User:Jeffrey O. Gustafson/Contributions|Shazaam!]]'' - [[User_Talk:Jeffrey O. Gustafson|<*>]] 08:04, 3 November 2005 (UTC)

== Images ==

Thanks. Done as suggested. Doubtful whether they will spend so much time on this. I may have to forget.
I do not want to trouble you more on this taking away your precious time.

Is it worth for me to '''register under preferences''' at this age, in my last lap of journey?

--[[User:Dore chakravarty|Dore chakravarty]] 08:33, 3 November 2005 (UTC)

== [[Boston, Massachusetts]] - summary style ==

I recently ran into problems concerning summary style for the article on FAC (there are some people who believe that the article does not have enough material). I was wondering what is your exact thoughts on the matter since now I am thinking of abandoning the idea of keeping articles close to 35 kB. [[User:Pentawing|Pentawing]] 22:56, 3 November 2005 (UTC)

== About India ==

I have again reverted some of your edits (Minor)
*Your pronunciation rendering of Bhārat is incorrect. It is not "bhərəth". I have not followed IPA exactly because it gives very clumsy script, but I have rendered the correct pronunciation in easier letters, as you would see in most dictionaries.
*Your spelling of Hindustan is also incorrect, as well as its pronunciation.
*I have now reverted Mughal to Islamic, because India was known as Hindustan from times immemorial in Persia and Arabia. It was not the Mughals who first called Hindustan, but it was the Sultans of the Delhi Sultanate period, 1100 AD and later. And one of them, Allauddin Khilji had the largest empire ever in the subcontinent, including all except a very small part of South India too.

My mother tongue is Hindi and I also know enough linguistics. I also stay in Bombay at present, if you have any doubts you are most welcome to message me or see me in person.

I have again made corrections.
*Your twelvth century was good.
*I have just corrected IPA for bharat. The first a is long back vowel α: and not ə: . The [[schwa]] ə can never be stressed. And the end t is dental, okay, but never aspirated. So I removed the 'h' from it.
*Hindustan has a short 'u'. The Hindi spelling that I have written is correct. In the pronunciation I have removed the long 'u:' to short one.
[[User:Magicalsaumy|Cygnus_hansa]] 12:21, 5 November 2005 (UTC)

== Patimokkha or whatever ==

You appear to have closed the AfD for the Patimokkha thingy, with a result of '''delete'''. Why have you not also deleted [[Essa writting map]]? [[User:JIP|&mdash; <font color="#CC0000">J</font><font color="#00CC00">I</font><font color="#0000CC">P</font>]] | [[User talk:JIP|Talk]] 18:42, 5 November 2005 (UTC)

== Graphs ==

Certainly. I have records on every nom from June 23 forward with votes, edit counts, who made the nomination, time of first edit for the nominee, etc. I can do this on Monday. I'm uncertain of exactly what you're looking for though? --[[User:Durin|Durin]] 18:42, 5 November 2005 (UTC)

== [[WP:AN]] ==

I just went to the [[WP:AN|Administrators' noticeboard]] to add it to my watchlist, and I found it was protected. Is this normal? I didn't want to make a mess with my first use of superpowers, so I thought I'd leave it to you. Cheers, [[User:Physchim62|Physchim62]] [[User_talk:Physchim62|(talk)]] 15:46, 6 November 2005 (UTC)

== Woot!..... ==

[[Image:Jelebi close.jpg|thumb|[[Jalebi]]'s for your support.]] Hey..Thanks a ton for nominating and supporting me. That alone brought me a lot of votes and I just about managed to get into the [[User:Zzyzx11/RFA nomination records|record books]]. I hope I can keep up your trust. Thanks again. --[[User:Pamri|Pamri]] <sup>&bull; [[User_talk:Pamri|Talk]] &bull; [{{SERVER}}{{localurl:User_talk:Pamri|action=edit&section=new}} Reply]</sup> 16:11, 6 November 2005 (UTC)

Revision as of 15:39, 13 October 2008

Barnstar

Thanks ! Tintin 13:22, 23 October 2005 (UTC)

Boston, Massachusetts

I am thinking of nominating this article for FA soon, but I need a final look before I proceed. Thanks. Pentawing 21:02, 23 October 2005 (UTC)

CBW RfA

Thank you for taking the time to vote on my RfA. If you have any concerns over my actions please let me know. Thanks CambridgeBayWeather 23:04, 23 October 2005 (UTC)

Madhuri Mehta

Hello,

I want to thank you personally for your acting with great decency when you re-attached my grandmother's article on my personal page, instead of deleting it.

Nirav Maurya.

SC Seal

The image on the extreme left of http://supremecourtofindia.nic.in/title1g.gif seems to be a seal. I found textual references about a seal, but no images. --Pamri • Talk 02:52, 25 October 2005 (UTC)

Do you mean this? From what I have read, it is choosen by the Chief Justice. So it may even change every year. --Pamri • Talk 14:41, 26 October 2005 (UTC)
One lawyer I talked to today, suggestd using either the image in the URL I pasted above or the image of the Supreme Court below http://supremecourtofindia.nic.in/new_s/juris.htm

--Pamri • Talk 18:22, 30 October 2005 (UTC)

Renameuser function

Hello,

You wrote on Wikipedia talk:Changing username that the renameuser function was disabled. Do you know where it's possible to have news about it ?

It was discussed in IRC, but the only place on WP is here. =Nichalp «Talk»= 15:38, 26 October 2005 (UTC)

Happy Deepavali

Wish you and family Happy Deepavali.

--219.89.100.228 04:21, 26 October 2005 (UTC)

Thank you. :) =Nichalp «Talk»= 15:30, 26 October 2005 (UTC)

I wish you a happy Deepavali, too. — Rickyrab | Talk 20:11, 30 October 2005 (UTC)

Sorry about the outburst, but Wikipedia is driving me NUTS with those auto-logouts that should NOT be occurring. Somebody oughta DO something about this problem. — Rickyrab | Talk 20:13, 30 October 2005 (UTC) Rickyrab | Talk

Thank you. :) — Rickyrab | Talk 11:23, 31 October 2005 (UTC)

Padma awardees

Hi Nichalp, hope you remember abt the discussion I had with you when you created the Category:Padma Bhushan awardees. After your suggestion, I've gone ahead and created the other two categories to complete the set. The categories, Padma Vibhushan, Padma Bhushan and Padma Shri have been populated with 40+, 65+ and 100+ articles respectively. For most of the articles in the last category, it meant finding and entering the award information and then categorising it. btw, do u prefer Nicholas or is Nichalp ok? --Gurubrahma 18:26, 26 October 2005 (UTC)

Great! Both names are fine. =Nichalp «Talk»= 18:53, 26 October 2005 (UTC)

Quick question

Nichalp, a quick question: can any image that is found in a .gov website be uploaded? Thanks. Flcelloguy | A note? | Desk | WS 00:36, 27 October 2005 (UTC)

Thanks. Flcelloguy | A note? | Desk | WS 21:42, 28 October 2005 (UTC)

RfA

Hi Nicholas, Thanks for your lovely comments and your vote. I wasn't prepared for the public character assassination and general nastiness, and would never have agreed to the nomination had I known I'd be up for so much pain and embarrassment. It's turned WP from fun into distress, and has severely, and perhaps permanently, dented my enthusiasm for contributing. It's just not worth it. Cheers and thanks again for your support.Tony 06:52, 28 October 2005 (UTC)

Rivers of India

Nicholas,
I've done a major rewrite of this page and have subsequently created about a dozen articles related to it. Coments would be appreciated (if you have time). --You know who sends you peer review requests

Archiving of Wikipedia talk:Requests for adminship

You archived several ongoing discussions on Wikipedia talk:Requests for adminship that had edits today and yesterday. I realize the page was getting long, but archiving ongoing conversations seems...a bit out of line. I respectfully request you reinstate the conversations that had comments today, and perhaps those with comments dated up to yesterday. --Durin 19:18, 28 October 2005 (UTC)

  • I was referring in general. I've archived the page once myself, but the metric I used was archiving through to the point where a subsection had not been commented on for at least three days. There's scalability problems here; the page by any metric is going to be well beyond 32kb by the time next year. --Durin 11:46, 29 October 2005 (UTC)

Necrothesp has set his email.

Just dropping you a note to let you know that Necrothesp has set his email, per your request at Wikipedia:Requests for adminship/Necrothesp. Cheers!  BD2412 talk 19:45, 28 October 2005 (UTC)

Should I be an admin?

I noticed that I had admin powers now, but my RfA only had ~60% support. So did I get promoted by accident?--Shanel 19:53, 28 October 2005 (UTC)

Waterfall Gully

I've made changes from the comments you gave, mind having another look and possibly expanding on what you've already said? Cheers, - michaelg 10:57, 29 October 2005 (UTC)

You offered to draw a map for the suburb. Appropriate reference maps are here, here, here and here.
Cheers, - michaelg 12:40, 29 October 2005 (UTC)
here's one for the outline of the suburb and here's one in relation to the city center. This one also might be useful!
Cheers, - michaelg 13:11, 29 October 2005 (UTC)
I'll be thankful for what we get. We're lucky enough to have you offer to do it anyway!
Cheers, - michaelg 13:30, 29 October 2005 (UTC)
I've changed a bit, to make it more accurate but great job! File:Wgullymap fixes.png
  1. I've made the green bit the CBD itself
  2. I didn't know your original fonts or anything so please be nice in regards to the changes!
  3. Just hoping you could neaten it up so everything is standard as before.
  4. By the way, what program/s did you use to create this?
  5. Thanks!
Cheers, - michaelg 01:01, 30 October 2005 (UTC)
Delete any of the ones up to my final one, and if your final one is better, delete my final one too. - michaelg | talk 08:36, 30 October 2005 (UTC)
Justa sec, can you link me to your new image first before deleting Adel wgully map.png? Kill the other one. Cheers, - >>michaelg | talk 11:28, 30 October 2005 (UTC)
Hate to be picky, but you've labelled what is Greenhill Road as "Yarrabee Road". Yarrabee is simply a small offshoot of Greenhill Road in the suburb of Greenhill. If you want to correct this, it'd be great. Other than that, big thanks for now supporting! Cheers, - >>michaelg | talk 11:40, 30 October 2005 (UTC)

Thank you

Thanks!
Thanks!

Thank you ever so much for promoting me! I know you're quite busy, so I appreciate you taking the time :-) Kirill Lokshin 12:53, 29 October 2005 (UTC)

Bye

Nicholas,

It was nice to know you a little over the last few months. In my memory, I wonder whether you are willing to promote some changes to the current RfA system, which I (and others) have found traumatic. My suggestions are somewhere on that abusive page. Tony 14:01, 29 October 2005 (UTC)

I do take it personally; looks like you're not prepared to do anything about it. Tony 19:41, 29 October 2005 (UTC)

Adminship

Thanks Nick, but not in the immediate future. Tintin 19:06, 29 October 2005 (UTC)

I would. Thanks for asking. --Pamri • Talk 03:54, 30 October 2005 (UTC)
Yes sir..I have finished the formalities. Thanks for trusting and nominating me. --Pamri • Talk 17:06, 30 October 2005 (UTC)

Congrats

Thanks for your congrats on my adminship! --Edcolins 20:04, 29 October 2005 (UTC)

Template:PD-IndiaGov

User:Eugene van der Pijll claims that the Right to Information Act is only a FOIA-type act, and does not put Indian government publications in the public domain at all. The User has bought up the matter at Wikipedia talk:Copyright problems. Since the template PD-IndiaGov was initially created by you in Wikimedia Commons, I hope that you would look into the matter and resolve the dispute. --Deepak|वार्ता 17:34, 30 October 2005 (UTC)

Done posting to the list. Are you subscribed to it? --Pamri • Talk 07:23, 1 November 2005 (UTC)
Thanks and wish you the same. If you can't recieve the mails, ping me & I will forward it to you. --Pamri • Talk 07:31, 1 November 2005 (UTC)

Editing Talk:Chennai (comment)

Please see the addition suggested on this talk page and opine.

--Dore chakravarty 23:29, 30 October 2005 (UTC)

Map of the 17 provinces

Dear Nicholas,

Yes it is true one could make a simpler map. I however personally think it is not that easy to make it better. You'll find many historical maps of the region at this time on the site:

http://www.zum.de/whkmla/histatlas/lowcountries/haxbelgium.html

One of the difficulty you're going to meet is that it is difficult to establish the exact border at an exact time. Those borders were not very stable depending on the alliances and wars with the neighbouring states. It is also difficult to know how to count the 17 provinces. Have a look at the article Seventeen Provinces and its discussion page for details about the controversy.

I think what should appear clearly on the map is the following:

  • The internal borders in order to show that there is no border corresponding to the current Belgo-Netherlandish border
  • A clear different color for the bishopric of Liege which does not belong to the 17 provinces

Vb 08:33, 31 October 2005 (UTC)

RFA end-date

Thanks for pointing out the stamping/formatting problem with my RFA end-time. I wasn't 100% sure if it was the 'done thing' for me to fix this, or to wait and see if the nominator would. And nor am I, entirely, about when the exact end-time should be -- practice seems to vary somewhat between nomination time, acceptance time, and listing time (+7d). Anyhoo, done now (and going with the conversative (and I think logical) listing-time interpretation). Alai 00:55, 1 November 2005 (UTC)

your message

Nicholas, I don't feel betrayed by you at all, and I've comprehended the points you made. The problem is that the RfA process does result in personal comments as it is currently framed, and provides no protection for any of the participants. I was just totally unaware that it would be like that, and would never have aggreed to it if I had been. If there's any further need to talk, please use the email facility. Best wishes too. Tony 05:33, 1 November 2005 (UTC)


Happy Diwali!!

Happy Diwali!

Happy Diwali to you!!--May the Force be with you! Shreshth91($ |-| r 3 $ |-| t |-|) 08:04, 1 November 2005 (UTC)

No articles to review, but you should check this out:
v • e • d • h • w
  • Requests: Sibichen K Mathew, Dominic Emmanuel, AK Merchant, Counterfeiting of currency notes in India, Akhand Pratap Singh, Asura (band), Asian Variety Show, Cultural liberalism in India, India Export Tax, India Import Tax, More...
  • NPOV: Greater Nepal Rajneesh, Ranjit Lal Jetley Hedgewar, Puttanna Kanagal, Bride burning, Sonia Gandhi More...
  • Wikify: Railway stations, Mahavidwan R. Raghava Iyengar, Silk in the Indian subcontinent, IDBI Bank More...
  • Cleanup: , Rampur, Tav-Prasad Savaiye, Shipping Corporation of India, Velama, Medical college (India), All India Radio, More...
  • Merge: Raghava Rama, Sammar Bahisht, Sathya Sai Baba movement,More...
  • Expand: Prime Minister of India, Krishna district, List of railway stations in India, Swaraj, Ashoka Kumar Thakur vs. Union of India (Supreme Court Case), Barak Missile Deal Scandal, 14th Lok Sabha, Adithada, Ali Sardar Jafri, Bandhani work, Bhaiband, Chikan (embroidery), China Town, Kolkata, Rahi Masoom Raza, Energy policy of India, Essar Shipping, Fair use, Hinduism in India, Imperial Bank, Inbuan Wrestling, Iran-India relations, Islam in India, Arjuna award, Sunil Mittal, Save Indian Family, Anjana Sukhani, Rajendra K. Pachauri, More...
  • Stubs: Anand Math, A R Antule, Arjuna award, Army of India, Bapudeva Sastri, Bombay Dyeing, Indian Copyright Act, Marimallappa, Mumbai Skywalk, More...
  • Translate: Bhojpuri Wikipedia articles, Maithili Wikipedia articles, Telugu Wikipedia articles, Marathi Wikipedia articles, Hindi Wikipedia articles, Sanskrit Wikipedia articles, Tamil Wikipedia articles Kannada Wikipedia articles
  • Collaborate: Collaborations of the Month, Notice board, Category Adoptions To do, Version 1.0 assessment, India Portal, Life in India, India quick links Indian Wikipedians, More...
  • Requested images: Ilaiyaraaja, M. S. Subbulakshmi, R. K. Narayan, Free image of Aarti Chhabria
  • Other requests:
    • v • e • d • h • w

    --May the Force be with you! Shreshth91($ |-| r 3 $ |-| t |-|) 08:19, 1 November 2005 (UTC)

    Question

    Hi, thanks for you vote on the Canberra FAC. In reponse to your question, I like to let my articles sit around for a month or two to mature before I nominate them, that way I'm satisfied them and then there are no major changes to make when FAC come around. Since you're a bit of a Wiki wiz, I was wondering if you know how to add optional fields to templates. We need to know for Template:Infobox Australian City, help, if you know how, would be appreciated.--nixie 10:27, 1 November 2005 (UTC)

    We want to add several optional parameters to Template:Infobox Australian City, including one for government (governemnt arrangements vary widely between Australia cities ) and on for the flag and crest (some cities don't have one). I got some instructions from SEWilco, but I really need to see it in practice to know how to do it myself.--nixie 01:17, 2 November 2005 (UTC)

    Photos

    Hi Nichalp. Photos of an adult shoeshine boy, or boys, would be just as welcome, and would be a great aid in improving the article. Thanks! Proto t c 13:30, 1 November 2005 (UTC)

    Project Cricket

    I'm willing to help with this project as much as possible, but i have looked through the article writing help thing, and i havn't got a chance of writing that confidently. I can help with recording some small videos and taking photos of bowling actions, and cricket grounds around the UK. I also ahve a few videos and images from test matches in England, and possibly one from a Gloucestershire County game. I can get a lot of county pictures during next summer, and also some Internationals, the England ones most likely.

    Cheers. cc2003btw

    Image:Des-1-KYM.jpg- copyrights

    Images in the web site maintained by a software company has allowed saving emailing etc. If so can the images not be considered as free from copyright laws by Wiki policies? Your opinion please. Another administrator (Thuresson 10:20, 1 November 2005 (UTC))has said that it is not allowed and will be deleted.

    Swathi Soft Solutions--Email is not getting connected for me to get clarification from them.

    Details of web sites given here for information and check.

    http://www.kym.org/tkrish.html

    http://www.kym.org/tkvd.html

    Above sites developed and maintained by

    http://www.softsolutions.co.in/

    --Dore chakravarty 21:00, 1 November 2005 (UTC)

    Thanks for the wishes

    Thanks for your wishes, and it really looks very odd on my part – to say you a happy diwali, after the event is over. However, we wikipedians can always celebrate the festival of light by doing something good here. --Bhadani 14:59, 2 November 2005 (UTC)

    Syed Mohammed Hadi

    I came across the great grand-daughter of the man who scored the first hundred in Ranji trophy User_talk:Tintin1107#Syed_Mohammed_Hadi . I am thrilled ! Tintin 16:20, 2 November 2005 (UTC)

    RFA

    Hi! As you know, your RFA bid did not receive the required level of support and I had to fail it. This does not mean that you cannot be an admin, you can try again some other time and reflect on what went wrong in this RFA. Regards, =Nichalp «Talk»= 18:54, 2 November 2005 (UTC)

    Thank you for closing the vote and thank you for the advice. You followed established procedures and conventions, of course, and I can have no complaint. Just one minor thing I'm wondering about - did you discount exactly two support votes or did you just not update the counter? :) It's a trivial matter, of course, I'd just like to make sure that the archive is accurate. - Haukur Þorgeirsson 19:12, 2 November 2005 (UTC)
    Thanks! - Haukur Þorgeirsson 19:20, 2 November 2005 (UTC)

    Image:Des-1-KYM.jpg

    Thanks for reply. Difficult to understand. Please opine for my future references only, on the reply received from publisher, as under. Received reply from relevant WEB publisher as under,

    Original Message -----

    From: K S Sudhakar To: marc_d@softhome.net ; solutions@swathigroup.com Sent: Wednesday, November 02, 2005 10:47 PM Subject: RE: Copyright-http://www.kym.org/contactus.html

    The photographs used in KYM site are taken by the Executive trustee of KYM and he has permitted its usage for KYM website.

    sudhakar

    Above information with the following data given with the uploading, does it satisfy the requirements of WIKI please?

    Photo taken from web site: http://www.kym.org/tkvd.html and maintained by http://www.softsolutions.co.in/ which allows saving and emailing etc. No copy right is mentioned. Hence assumed no copyrights exist.

    --Dore chakravarty 21:00, 2 November 2005 (UTC)

    Pseudo-RfC

    Nichalp - Firstly how does one vocalise that? "Nee-Chulp"? "Nitch-alp"? Anyway. I've made a note that at the top that the nomination has failed. I've also asked that it be left open until roughly midnight, to allow for any extra input. As it's been very civil, cordial almost, I don't see the harm and I've drawn a lot of valuable input from the process. If, however, you're of the opinion that both no good can come of it and that damage will be done, show it the door. Unless you're looking for me to use the word "withdraw" to make it official? - brenneman(t)(c) 05:48, 3 November 2005 (UTC)

    Hi! I've removed your nomination. The problem is the pileon votes which will increase. RFA is the forum to ascertain the suitability of a candidate for adminship. For feedback, an RFC on yourself would be better. Having your nomination go on would be pointless IMHO, and unnecessarily increase the server load. Regards, PS I think the latter pronounciation would be fine. Nichalp is a combination of a few letters of my name, and surname. Regards, =Nichalp «Talk»= 06:01, 3 November 2005 (UTC)
    • Oh. All right then. I must be honest and say that seems, well, overly officious. I'm aware that an RfC would be the place had I been seeking feedback, but here I was trying to elicit more of what had been forthcoming. As to the "pile on" I'm not sure how that's a problem, as if they had brought points that I could improve that hadn't been touched yet, that would be the point. Finally, server load... that leaves me gobsmacked. You've got a templated sig. I'm not fussed by the removal per se but, well, yeah. Gobsmacked. - brenneman(t)(c) 06:11, 3 November 2005 (UTC)
    • Ok, I promise to listen to you if you promise to listen to my explanation the templated signature, deal?
      brenneman(t)(c) 06:38, 3 November 2005 (UTC)

    Template talk

    This all comes with the caveat that I've not studied up on the mediawiki software at all, but all similar systems have some of the same underlying principles. Also I have no idea (not having done any homework on you) what you level of knowledge is. It's very wiki, because if I say something wrong, someone is sure to correct me!

    Ok, when we type http:///en.wikipedia.org/wiki/foo into our browser of choice, three things happen. Ok, a lot more than three things happen, but we only care about three.

    1. The data is located
    2. The data is read
    3. It's processed to the screen

    Each of these things take a certain amount of time and cycles. Location is independant of the size of the article, but reading and processing both scale. So location, consisting of scanning the indicies and moving the read head to the correct location of the correct disk, takes 50 server "units" say. Reading the data and processing each take one server unit per kb. This is just made up, but you get the drift.

    My RfA page was 400 Kb, for total of 850 server units to display if there is no transclusion.

    If there are {{}} on the page, it must perform another step. It goes and gets that page in exactly the same manner that it does a regular one. So a template that is 25 bytes takes 100 server units to display, in addition to whatever else must be displayed on the page.

    Thus a page with 50 Kb plain and transcluding a 50 Kb template takes 150 units for the template and 150 for the plain text, 300 total. If the template had been converted into plain text via {{subst:}} it would have only taken 250 server units. That hypothetical fifty extra units is consumed every time someone refreshes (e.g. looks at) a page.

    Every time a page with you signature template is refreshed, anywhere. 12658 edits, conservativly 75% have signatures, say only 50% of those on pages with any traffic, that's still a lot of refreshes. Or, if by removing my 400 Kb RfA you stopped it from being refreshed 100 times, you'd have saved 85,000 server units. If your 15 Kb sig was in only 100 places and each were refreshed the same 100 times, that's 800,000 server units or almost ten times the extra load placed on the box as you'd have saved. So that's why I got a bit shirty before, eh?

    Of course, it is all much more complicated than that. Dynamic caching, incremental fetch, intelligent partitioning, it's a black art. But the basics are still true.

    And what for? Use Preferences -> raw signatures, and never have to listen to guys like me whine again.

    Thank you for indulging me!
    brenneman(t)(c) 12:04, 3 November 2005 (UTC)

    Administrator

    Just now I saw the list of Adm. and saw your name there indicating from 27 Sep 2004 (UTC).

    I really appreciate your knowledge and interest and wish you all the success in your errand.

    --Dore chakravarty 06:26, 3 November 2005 (UTC)

    Thanks!

    Thanks for hooking me up with the promotion on my RfA! I hope to do good by all who supported me. Thanks for your time! --Jeffrey O. Gustafson - Shazaam! - <*> 08:04, 3 November 2005 (UTC)

    Images

    Thanks. Done as suggested. Doubtful whether they will spend so much time on this. I may have to forget. I do not want to trouble you more on this taking away your precious time.

    Is it worth for me to register under preferences at this age, in my last lap of journey?

    --Dore chakravarty 08:33, 3 November 2005 (UTC)

    Boston, Massachusetts - summary style

    I recently ran into problems concerning summary style for the article on FAC (there are some people who believe that the article does not have enough material). I was wondering what is your exact thoughts on the matter since now I am thinking of abandoning the idea of keeping articles close to 35 kB. Pentawing 22:56, 3 November 2005 (UTC)

    About India

    I have again reverted some of your edits (Minor)

    • Your pronunciation rendering of Bhārat is incorrect. It is not "bhərəth". I have not followed IPA exactly because it gives very clumsy script, but I have rendered the correct pronunciation in easier letters, as you would see in most dictionaries.
    • Your spelling of Hindustan is also incorrect, as well as its pronunciation.
    • I have now reverted Mughal to Islamic, because India was known as Hindustan from times immemorial in Persia and Arabia. It was not the Mughals who first called Hindustan, but it was the Sultans of the Delhi Sultanate period, 1100 AD and later. And one of them, Allauddin Khilji had the largest empire ever in the subcontinent, including all except a very small part of South India too.

    My mother tongue is Hindi and I also know enough linguistics. I also stay in Bombay at present, if you have any doubts you are most welcome to message me or see me in person.

    I have again made corrections.

    • Your twelvth century was good.
    • I have just corrected IPA for bharat. The first a is long back vowel α: and not ə: . The schwa ə can never be stressed. And the end t is dental, okay, but never aspirated. So I removed the 'h' from it.
    • Hindustan has a short 'u'. The Hindi spelling that I have written is correct. In the pronunciation I have removed the long 'u:' to short one.

    Cygnus_hansa 12:21, 5 November 2005 (UTC)

    Patimokkha or whatever

    You appear to have closed the AfD for the Patimokkha thingy, with a result of delete. Why have you not also deleted Essa writting map? — JIP | Talk 18:42, 5 November 2005 (UTC)

    Graphs

    Certainly. I have records on every nom from June 23 forward with votes, edit counts, who made the nomination, time of first edit for the nominee, etc. I can do this on Monday. I'm uncertain of exactly what you're looking for though? --Durin 18:42, 5 November 2005 (UTC)

    WP:AN

    I just went to the Administrators' noticeboard to add it to my watchlist, and I found it was protected. Is this normal? I didn't want to make a mess with my first use of superpowers, so I thought I'd leave it to you. Cheers, Physchim62 (talk) 15:46, 6 November 2005 (UTC)

    Woot!.....

    Jalebi's for your support.

    Hey..Thanks a ton for nominating and supporting me. That alone brought me a lot of votes and I just about managed to get into the record books. I hope I can keep up your trust. Thanks again. --Pamri • Talk • Reply 16:11, 6 November 2005 (UTC)

    Retrieved from "https://en.wikipedia.org/w/index.php?title=Kolmogorov_complexity&oldid=245009060"