Reddit User Directory
Browse Reddit users who have submitted in our directory:
- moniquesleads •
- kadyw2020 •
- daenkblog •
- sareez •
- JakovAndric •
- suranjna06 •
- sidepart •
- lgseccionph •
- gadabinausaha •
- Seoworkers •
- BioGeek •
- Teaboy •
- Caree •
- thehoof •
- sanakan •
- licenseplate •
- catzilla •
- thesunmaster •
- imamonkeytoday •
- dihydrogen_monoxide •
thesunmaster Bookmark Updates
You are reading 20 most recent bookmarks from
http://www.reddit.com/user/thesunmaster 
.
Reading thesunmaster - updated in 1.578 seconds.
Please do continue...
thesunmaster updated on 9 Jul 2011:
 | submitted by thesunmaster to aww [link] [comment] |
http://www.reddit.com/r/aww/comments/ikyod/please_do_continue/
thesunmaster on IAmA guy who climbed Kilimanjaro in a penguin suit. AMA
thesunmaster updated on 5 Jul 2011:
I think Kallahan11 is refering to [this](http://www.youtube.com/watch?v=BdMV42czPCI) Monty Python sketch.
http://www.reddit.com/r/IAmA/comments/igh33/iama_guy_who_climbed_kilimanjaro_in_a_penguin/c23n8cg
thesunmaster on Brief question on NP Oracles
thesunmaster updated on 17 Jun 2011:
Edit: I misread your problem. The below is true for NP-complete L. For any L \in NP, it is not true in general (assuming certain things). See http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.4445 for details. You can always obtain such a polynomial time Turing machine. The answer becomes fairly obvious and is a generalization of your proof for SAT once you notice two things: a) You can do away with ``oracle O for L in NP'' and replace it with ``oracle for NP'' (complexities change by polynomial factors). It does not make a difference in writing, but makes a difference in how you think about complexity classes. b) Consider the problem of checking whether a partial certificate can be completed to a valid certificate of x \in L. This problem is in NP. (From a verifier of x and certificate(x), you can construct a non-deterministic polynomial TM which guesses the rest of the certificate). Now, use your cool oracle for NP to decide this problem repeatedly as in the SAT case. Guess the first symbol of the certificate and ask the oracle if it can be completed and so on... This problem becomes way more interesting for some other complexity classes. Look for a paper by Bellare and Goldwasser titled something like ``The complexity of decision and search''.
http://www.reddit.com/r/math/comments/i1rho/brief_question_on_np_oracles/c207dzt
thesunmaster on A simple latex to unicode converter written in python: \beta^2 => β²
thesunmaster updated on 10 Jun 2011:
It would be really useful over at /r/math if you put it up on a server. Have you thought of extending it to convert more complex math in to unicode + reddit markup for layout?
http://www.reddit.com/r/programming/comments/hw60j/a_simple_latex_to_unicode_converter_written_in/c1yv1uh
thesunmaster on Help me find a webcomic that compared the size of the universe to our galaxy to our solar system, all the way down to atoms and strings.
thesunmaster updated on 15 May 2011:
It is something from abstrusegoose. I will try to find it. Here you go: http://abstrusegoose.com/73
http://www.reddit.com/r/comics/comments/hbjd4/help_me_find_a_webcomic_that_compared_the_size_of/c1u476p
thesunmaster on One of my undergraduate math classes requires students to form (and name!) teams. Help me name my team.
thesunmaster updated on 12 Sep 2010:
Rage against the Turing Machine
http://www.reddit.com/r/math/comments/dcoba/one_of_my_undergraduate_math_classes_requires/c0z8631
thesunmaster on How to deal with spoilers when performing magic?
thesunmaster updated on 17 Feb 2010:
An Aztec tomb of some kind would be in order.
http://www.reddit.com/r/AskReddit/comments/b2zci/how_to_deal_with_spoilers_when_performing_magic/c0kpfqb
thesunmaster on TIL How Tower Cranes are Put Up
thesunmaster updated on 13 Dec 2009:
A very nice [video](http://www.youtube.com/watch?v=RB91Sm-kGJ8) demonstrating the process.
http://www.reddit.com/r/todayilearned/comments/adxnl/til_how_tower_cranes_are_put_up/c0h3mtv
thesunmaster on Does anyone understand Blum's speedup theorem?
thesunmaster updated on 29 Nov 2009:
www.cs.uchicago.edu/~fortnow/papers/history.pdf
http://www.reddit.com/r/math/comments/a8x0s/does_anyone_understand_blums_speedup_theorem/c0gecuy
thesunmaster on Does anyone understand Blum's speedup theorem?
thesunmaster updated on 28 Nov 2009:
See the proof of the Time hierarchy theorem. The proof heavily uses the fact that the functions are time constructible. For example, DTIME(o(f(n)/log(f(n)))) is strictly contained in DTIME(f(n)) given that f(n) is time constructible. Link to the [proof](http://en.wikipedia.org/wiki/Time_hierarchy_theorem)
http://www.reddit.com/r/math/comments/a8x0s/does_anyone_understand_blums_speedup_theorem/c0ge4jg
About thesunmaster Bookmark
Read submitted updates on Reddit by thesunmaster with reddit StatusReader, an all in one Social Networking, Social Bookmarking and Microblogging status updates reader. Browse Reddit User Directory to search more profiles.
followers![[link]](http://i.imgur.com/JvUzt.jpg){kind=link}