Why don't you study Algorithms & Complexity?

Why don't you study based Algorithms & Complexity theory?

Because it's middle school level.

Finally found someone that knows something. Since you know complexity theory, please inform me whether all problems that can be computed by a probabilistic TM (with error probability < 1/3) in polynomial time be solved by a deterministic TM in polynomial time?

No, because you need to roll the dice a lot of times until you get the result, you end up on average having to roll it a lot. I can't explain it better, but it's NP, it's exponential. It's basically an exhaustive search, you're rolling the dice, you're shooting a barrel of fish and hoping that you hit the right one and your chances are about 2/3 but that doesn't exclude the event of you never reaching an answer by only getting an incredibly high number of sequential errors. Only an infinity of trials can guarantee success in this case.

That's not what OP asked. Please reread the question.

but I'm OP, that guy wasn't OP

Oh, apologies. I imagined you wrote .

Yes, I know BPP exists. Why don't you prove BPP⊆NP.

>but it's NP, it's exponential

No and no. This is why cs majors belong in the

I doubt someone saying is a CS major brah.

I studied some algos and complexity as part of my programming hobby

i used the MIT courses though

Good for you user. I say this in a non condensing way. I think that's awesome. I'm doing the same before I take an algorithms course and plan to follow it up with the advanced version

Let's be honest with ourselves Veeky Forums

99% of you, including pure mathfags would fail Google's on-site interviews in algorithms.

cause I'm not a brainlet

but you are, see and

>99% of you, including pure mathfags would fail Google's on-site interviews in algorithms.

t. brainlet that thinks he's a genius for summing all primes under a million.

have an algorithms course over the summer, op. should be cool, i like the professor

talk is cheap, trolling doesn't automatically make you able to solve algorithm problems brainlet.

I do. I'm a graduate student in theoretical computer science.

How does it feel to deal with people like:
These are undergrads that think you do web dev tier work.

Then go pass the interview and get a job making $170k/yr with stock bonuses

src=I failed my google one lol fml my brain wouldnt work

you should have told them you'd google the answer

In my days as an undergraduate with interests in theory, it used to bother me somewhat.

I now have enough life experience to see that statements like the ones to which you refer are either made by trolls or people who are genuinely ignorant (willfully or otherwise) of the true content of the field. I also have enough worldly experience to know that my specialized knowledge is both useful and highly valued.

I am in random graphs / structures / algorithms. I have some results in complexity theory, but it's not exactly my bread and butter.

Maybe it's because I don't have much experience with it, but it seems hard as fuck. I don't know how these bastards cook up their "gadgets" to show problems are NP complete etc.

Agreed.

I did pure math as an undergraduate. I know people like are idiots and no longer pay attention to them.

can't believe he's flashing gang signs in class.

keeeek

brainlet here. I know how to make a sieve of earthanus and the obvious way of brute force checking each number. Is there a better way to find primes that doesn't take either tons of time or tons of memory?

sometimes i fantasize about deriving the speed of light from some type of automata and shaking up the world

i dropped out of undergrad tho lol

im the 1% :)

what does "find" primes mean? if you want to generate all primes in a range you're not going to be able to do much better, the amount of primes in a range of size n is around n/logn.

if you want to check if one number is prime there are tons of crazy as fuck methods, there's pollard rho for instance and there's also probabilistic crazy stuff

Yes there is. But you have to prove the Riemmann hypothesis.

prove right***

>theoretical computer science
Good luck with that.