User talk:Mellum

Hello, welcome to Wikipedia. Here are some useful links in case you haven't already found them:

• How to edit a page
• How to write a great article
• Naming conventions
• Manual of Style

If you have any questions, see the help pages, add a question to the village pump or ask me on my talk page. I hope you enjoy editing here and being a Wikipedian! Cheers!

Tip: you can sign your name with ~~~~ --Yacht 16:37, Mar 8, 2004 (UTC)

Hi, saw that you reverted my incorrect edit on NP-complete. Got the point, thanks. Can you also answer the question that I've posted in Talk:NP-complete? -- Sundar 11:03, Nov 25, 2004 (UTC)

Provably vs. probably

Just saw the history of you fighting the change made by many an editor from provably to probably on Heuristic: I guess you're solution will hold, but a technique that might also have worked is surrounding the word by comments, saying "the text really should stay the way it is" or "when I wrote provably, I didn't mean probably". --- Charles Stewart 14:32, 24 Mar 2005 (UTC)

1. bogus grammar & 2.invalid link on NP Completeness...

1. true, 2.false. True I corrected a grammatical error. False the link was invalid pehaps not specific enough but certainly the right link. Tagging as in a flash of persistence on a cat scan and relevant to my knowledge of P=NP and the deg of things. Apparently once it's true lots of things are true and I would argue it can be proved this way... Wittgenstein as in music and its various truths... the sound is the music the score is the music the masterpiece it's all true so all manifestations of it are essentially the same things and so in math when we solve NP Complete, then it's all true and all solved. Chicken and egg problem. Like Plato's last thoughts (so I read), it reuires a new language which underlies the language we use.

Anyway I was out of order and should have gone through a discussion on the merits of inclusion of a thread in my mind i.e. I should write the paper and have it recognised before I quote it but I'm lazy about that.

Regards, Brian.Fagan@Gmail.com

Articles you might like to edit, from SuggestBot

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

Stubs David S. Johnson Cograph Complement (complexity) Marek Karpinski Computation 2-satisfiability PH (complexity) Kazimierz Kuratowski Las Vegas algorithm Wandering salesman problem Algorithmic topology Bin packing problem RLP Horn-satisfiability Discrete optimization Complement graph FL (complexity) The Empty Mirror Introduction to Algorithms

Cleanup Early Nazi Timeline Nuclear energy policy Assignment problem Merge Subroutine Function problem PCP (complexity) Add Sources Thule Society Context-sensitive grammar Path (graph theory) Wikify List of open problems in computer science The Structure of Liberty Flatness problem Expand Degree constrained spanning tree Emergent algorithm Paul de Casteljau

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 ForteTuba, 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 17:04, 24 November 2006 (UTC)

NP-complete

Thanks for working on reverting User:ANONYMOUS COWARD0xC0DE's ill-conceived changes to NP-complete. I haven't gotten involved in the discussion myself, because so far you've said everything I thought was necessary. -- Dominus 15:28, 30 December 2006 (UTC)

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) 22:12, 30 November 2015 (UTC)

ArbCom 2018 election voter message

Hello, Mellum. 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)