User talk:Ott2

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Welcome to Wikipedia![edit]

Hello Ott2, welcome to Wikipedia!

I noticed nobody had said hi yet... Hi!

If you feel a change is needed, feel free to make it yourself! Wikipedia is a wiki, so anyone (yourself included) can edit any article by following the Edit this page link. Wikipedia convention is to be bold and not be afraid of making mistakes. If you're not sure how editing works, have a look at How to edit a page, or try out the Sandbox to test your editing skills.

You might like some of these links and tips:

If, for some reason, you are unable to fix a problem yourself, feel free to ask someone else to do it. Wikipedia has a vibrant community of contributors who have a wide range of skills and specialties, and many of them would be glad to help. As well as the wiki community pages there are IRC Channels, where you are more than welcome to ask for assistance.

If you have any questions, feel free to ask me on my talk page. Thanks and happy editing, -- Alf melmac 09:27, 23 January 2006 (UTC)

Thanks for the friendly welcome. -- Ott2 15:15, 23 January 2006 (UTC)
You're most welcome --Alf melmac 15:46, 23 January 2006 (UTC)

Why do you consider GA irrelevant to NP-complete ?[edit]

Please explain why in your revert here you feel linking the NP-complete article to Genetic algorithm an irrelevant addition ? How does the reader find their way from NP-complete to the GA article ? As an example the Travelling salesman problem is a NP-complete problem which Genetic algorithms can offer promising solutions and if the reader goes via TSP then they'll discover the GA article but I placed the reference to GA in heuristic so that a visitor to NP-complete could naturally follow to Genetic algorithm without going via TSP. If the reader is able to discover a set of articles when working one way through Wikipedia then it is NOT irrelevant to provide a way for them to discover the same set of articles through the reverse path. Ttiotsw 19:57, 21 September 2007 (UTC)

GA, simulated annealing, neural networks and so on are specific solution approaches for optimization, and they are examples of metaheuristic approaches: they are not heuristics for NP-complete problems. I have added a link to metaheuristics instead -- this should address your concern. --Ott2 20:54, 21 September 2007 (UTC)

August 2014[edit]

Hello, I'm BracketBot. I have automatically detected that your edit to Saharon Shelah may have broken the syntax by modifying 2 "{}"s. If you have, don't worry: just edit the page again to fix it. If I misunderstood what happened, or if you have any questions, you can leave a message on my operator's talk page.

List of unpaired brackets remaining on the page:
  • {{Quotation|But when I reached the ninth grade I began studying geometry and my eyes opened to that

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, BracketBot (talk) 07:57, 12 August 2014 (UTC)

Hello, I'm BracketBot. I have automatically detected that your edit to Pegler Yorkshire may have broken the syntax by modifying 1 "[]"s. If you have, don't worry: just edit the page again to fix it. If I misunderstood what happened, or if you have any questions, you can leave a message on my operator's talk page.

List of unpaired brackets remaining on the page:
  • boost-for-manufacturing-defies-slump-1-2344997 |title=£20m boost for manufacturing defies slump"], |publisher=Yorkshire Post |date=4 May 2009 |accessdate=23 August 2014}}</ref><ref>{{cite website |

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, BracketBot (talk) 19:18, 23 August 2014 (UTC)