# User talk:ElPoojmar

## Welcome!

Hello, ElPoojmar, and welcome to Wikipedia! Thank you for your contributions. I hope you like the place and decide to stay. Here are a few links to pages you might find helpful:

Please remember to sign your messages on talk pages by typing four tildes (~~~~); this will automatically insert your username and the date. If you need help, check out Wikipedia:Questions, ask me on my talk page, or ask your question on this page and then place {{help me}} before the question. Again, welcome!

## September 2013

Hello, I'm BracketBot. I have automatically detected that your edit to Solomonoff's theory of inductive inference 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:
• S will be strictly greater than one. To be more precise, for every $\epsilon$ > 0, there is some length ''l'' such that the probability of all programs longer than ''l'' is at
• * [[Martin Davis]] (2006) The Church–Turing Thesis: Consensus and opposition]". Proceedings, Computability in Europe 2006. Lecture notes in computer science, 3988 pp. 125–132

Thanks, BracketBot (talk) 14:29, 18 September 2013 (UTC)