Welcome to Incels.is - Involuntary Celibate Forum

Welcome! This is a forum for involuntary celibates: people who lack a significant other. Are you lonely and wish you had someone in your life? You're not alone! Join our forum and talk to people just like you.

Serious Ask a NEET child prodigy incel, who has a PhD (me) anything

  • Thread starter Deleted member 10234
  • Start date
Engineering, math, physics AND computer science. One of the reason they do that is because people in academy are so disconnect with the market. I would get if it was 2, or 3 in very few exceptions. But 4? Computer science? In a real job you'll be often doing specific things. Yeah you got a phd in computer science, meanwhile a dude that dedicated himself only to computer science will wagemog the shit out of you.
Bachelor's in electrical engineering, math,and physics. PhD was in CS- very closely related to EE.

And nope. Most people are too dumb to learn anything from CS degrees. I was a child prodigy in CS and had been programming since 10 years old. Someone who got a bachelor's in CS could NOT surpass me nor know more than me, considering how dumb modern CS majors are.
 
Being NT and a cool stereotype in that communities upholds tradition and the looksism thing would not be in effect. Every college video I used to see from a black social experiment youtuber acted almost the exact same way.
People liked the stereotype so it helps them grow a connection towards getting laid in that moment. Being a stereotype in that community its way easier to get a connection to other races cause that’s all they probably know.
 
You'll have to hook the operating system to do this

Windows kernel sets up each logical core IDT with fault handlers. If a fault can't be handled it displays a BSOD.

Windows kernel is ntoskrnl.exe so you'll want to disable PatchGuard and do your hooking somewhere here
Thank you kindly Dr. f1rem0th!
 
Holy fuck.

What is the best way to become good at dynamic programming? I'm having really difficult time in this shit. Any suggestion?
Well do you have problems with recursion? Can you solve these types of problems?
 
You'll have to hook the operating system to do this

Windows kernel sets up each logical core IDT with fault handlers. If a fault can't be handled it displays a BSOD.

Windows kernel is ntoskrnl.exe so you'll want to disable PatchGuard and do your hooking somewhere here
Thank you kindly Dr. f1rem0th!
 
How realistic is to mine helium-3 on the Moon? Is it possible in next 10 years? Maybe effort and not time is the most important factor and we could make it possible already? Is it really practical?
I'd have to look into this, as it's not something I've even heard about before.

One of the biggest problems is the cost of transportation from the Earth to the Moon. Bringing the payload and the equipment to the moon will be very expensive.
 
Bachelor's in electrical engineering, math,and physics. PhD was in CS- very closely related to EE.
And nope. Most people are too dumb to learn anything from CS degrees. I was a child prodigy in CS and had been programming since 10 years old. Someone who got a bachelor's in CS could NOT surpass me nor know more than me, considering how dumb modern CS majors are.
Ok, it's pretty clear that you don't understand how the market works. When a company hires you they don't give a shit of how many major you have, only how good you are in what they want you to do. Imagine if you could dedicate your whole life to computer science and get an actual job in a company, most of your knowledge will be useless. An average person that goes to medschool and specializes in something will wagemog the shit out of you.
Nowadays, specialty trumphs versatility. This is the natural course of history:division of labor.
brutal
 
Well do you have problems with recursion? Can you solve these types of problems?

Yea, that's why I said "dynamic programming" how do you solve a DP without formulating the recursion first? Is there anyway to solve DP without formulating the recursive equation?
 
Yea, that's why I said "dynamic programming" how do you solve a DP without formulating the recursion first? Is there anyway to solve DP without formulating the recursive equation?
No, because DP is an optimization of recursion. It deals with the notion of subproblems (same as recursion). If you can't solve it recursively first you're shit out of luck.
 
see my other threads
I'm obese but I have a round face, narrow mandible, melting eye area, and I'm bald.
Obesity is destroying your face. Your face fat is rounding your face and making your mandible look narrower than it really is. It could also be exacerbating your melting eye area look if you're storing fat on your brow. If you lost weight, your face would be more angular, your mandible's narrowness would be less pronounced, and you might even have a more youthful eye area.

But you're bald, so depending on your height and frame, it might be over for you regardless. Losing weight would be worth the trouble in any case. Obesity is a fate worse than death.
 
No, because DP is an optimization of recursion. It deals with the notion of subproblems (same as recursion). If you can't solve it recursively first you're shit out of luck.

Solving a recursion is a piece of cake, everyone knows it. The hard part is to come up with a suitable recursive equation. Sorry, my question was not that clear then. I was asking how do you come up with recursive formula when you encounter a DP problem? Is there any strategy? Or trick?

You interned at places like google, so these must be quite easy for you. They ask DP all the time during the interview.
 
Solving a recursion is a piece of cake, everyone knows it. The hard part is to come up with a suitable recursive equation. Sorry, my question was not that clear then. I was asking how do you come up with recursive formula when you encounter a DP problem? Is there any strategy? Or trick?

You interned at places like google, so these must be quite easy for you. They ask DP all the time during the interview.
There is no trick or magic strategy. Just practice enough times until it comes to you.

If you're able to solve it recursively then you should be able to come up with a recursive equation.

You do realize that there are only two ways of solving dynamic programming problems, right? You either solve it bottom-up or top-down. If you're solving it top-down then you just memoize solutions... you can literally plug it into your recursive equation. If its bottom-up its a little trickier, just use recursion "in reverse"

Because of your confusion, I don't think you really understand how to solve recursive problems but are just memorizing common solutions

So I recommend you go back and study recursion and solve more recursion problems first.

To solve any dynamic programming problem, you must first solve it naively (with recursion)... then you add the "dynamic" part to it. Either memoization or tabulation. So my advice? Go back and actually learn recursion.

Are you struggling academically with this? Eg, trying to prove your solution is correct, finding optimal substructure and overlapping subproblems, etc? Or is this just coding? Either way, refer to the above.
Obesity is destroying your face. Your face fat is rounding your face and making your mandible look narrower than it really is. It could also be exacerbating your melting eye area look if you're storing fat on your brow. If you lost weight, your face would be more angular, your mandible's narrowness would be less pronounced, and you might even have a more youthful eye area.

But you're bald, so depending on your height and frame, it might be over for you regardless. Losing weight would be worth the trouble in any case. Obesity is a fate worse than death.
I'm bald and just a little under 6'0" with small wrists and hands, so probably small frame. But being fat makes me look swole and big as fuck, especially since I have 24 in shoulders.
 
Last edited:
Obesity is destroying your face. Your face fat is rounding your face and making your mandible look narrower than it really is. It could also be exacerbating your melting eye area look if you're storing fat on your brow. If you lost weight, your face would be more angular, your mandible's narrowness would be less pronounced, and you might even have a more youthful eye area.

But you're bald, so depending on your height and frame, it might be over for you regardless. Losing weight would be worth the trouble in any case. Obesity is a fate worse than death.
Got the link? I'm not sure how to access earlier posts.
 
In a scale of 1 to 10 how over is it for you
 
I'm bald and just a little under 6'0" with small wrists and hands, so probably small frame. But being fat makes me look swole and big as fuck, especially since I have 24 in shoulders.
Lmao, no it doesn't, you look like the Pillsbury dough boy. People telling you how big and beefy you are is just them making fun of you under your nose; it's a backhanded compliment. Actual beefy "bear mode" guys aren't obese, they might be a bit overweight if they've been lifting weights for a few years, but not obese.
 
Does your proficiency in engineering and CS and all that also translate to abstract concepts, like writing and whatnot, or is it like high functioning autism, where they might be really good at maths or whatever, but can't express themselves. Also, how's your emotional intelligence and understanding of social situations?
 
If you have a PhD can't you get a job making a ton of money, buy a nice place, car, clothes, etc and land some pretty idiot?
 
Does your proficiency in engineering and CS and all that also translate to abstract concepts, like writing and whatnot, or is it like high functioning autism, where they might be really good at maths or whatever, but can't express themselves. Also, how's your emotional intelligence and understanding of social situations?
It transfers to everything. My EQ is normal. I'm just ugly.
If you have a PhD can't you get a job making a ton of money, buy a nice place, car, clothes, etc and land some pretty idiot?
No, because you don't get paid much money after taxes. Everyone pretty much makes the same money. A lot of specialist doctors in my family who only make around 150k/yr, and have several hundred K student loan debt, have to pay for medical insurance, etc.

At the end of the day doctors and engineers and people with PhDs pretty much make the same as common people who went into trades.
 
I'm a 23 year old NEET. I was a (minorly famous) child prodigy. I have a triple major in engineering, math, physics with a 95% cummulative average and a PhD in computer science. I'm also IEEE published.

I sit home and do nothing all day.

I'm a NEET.

Ask me anything

favorite area of mathematics?

for me rn combinatorics, i'm learning topology right now and it's quite fun.

how was a math major in college?

honestly just considering dropping my aspirations to study the biochemical sciences and deciding to hardsciencemaxx. either that or going full NEET and studying philosophy. i still have 2 years till college so hopefully i'll figure it out, should i doctormaxx?
 
favorite area of mathematics?

for me rn combinatorics, i'm learning topology right now and it's quite fun.

how was a math major in college?

honestly just considering dropping my aspirations to study the biochemical sciences and deciding to hardsciencemaxx. either that or going full NEET and studying philosophy. i still have 2 years till college so hopefully i'll figure it out, should i doctormaxx?

I'm into program analysis and compiler theory a lot, so I would have to say I'm interested most in decision problems, SAT solvers, order theory, set theory, abstract algebra, computability, that kind of stuff
 
How can I trust what your saying is true?
 
I'm into program analysis and compiler theory a lot, so I would have to say I'm interested most in decision problems, SAT solvers, order theory, set theory, abstract algebra, computability, that kind of stuff
nigga i don't even know what half those fields are JFL it's over IQmoggedtobolivioncels
 
There is no trick or magic strategy. Just practice enough times until it comes to you.

If you're able to solve it recursively then you should be able to come up with a recursive equation.

You do realize that there are only two ways of solving dynamic programming problems, right? You either solve it bottom-up or top-down. If you're solving it top-down then you just memoize solutions... you can literally plug it into your recursive equation. If its bottom-up its a little trickier, just use recursion "in reverse"

Because of your confusion, I don't think you really understand how to solve recursive problems but are just memorizing common solutions

So I recommend you go back and study recursion and solve more recursion problems first.

To solve any dynamic programming problem, you must first solve it naively (with recursion)... then you add the "dynamic" part to it. Either memoization or tabulation. So my advice? Go back and actually learn recursion.

Are you struggling academically with this? Eg, trying to prove your solution is correct, finding optimal substructure and overlapping subproblems, etc? Or is this just coding? Either way, refer to the above.

Thanks boyo. I will follow your suggestions.

Yea I'm having really difficult time academically with this DP shit. As I don't talk with people, I try to do everything by myself. I need your help boyo.

For example, I am having really difficult time finding a recursive formula for this problem. I need to solve it with O((log m) + n) memory (m = s and n = p). Could you please help?

Screen Shot 2019 10 28 at 61913 PM
Screen Shot 2019 10 28 at 61931 PM
Screen Shot 2019 10 28 at 61945 PM


I can do it in O(m * n), but I need to do with O((log m) + n). This is not a homework. I am practicing for my job interview.

I just need the recursive formula, that's all.
 
Took the WAIS IV with a psychologist couple of years ago and scored 151 on verbal and 138 on spatial sections but only 124 on working memory and 120 on processing speed (suffer from ADHD and depression). For all intents and purposes, should I just base my intellectual and academic capacity on my verbal reasoning? Or is it cope to ignore my two weaker areas?
 
without me doxing myself, you cant
that makes sense. anyways what's the best way for someone to learn all this engineering and math for free? best websites or maybe cheap books recommendations?
 
Thanks boyo. I will follow your suggestions.

Yea I'm having really difficult time academically with this DP shit. As I don't talk with people, I try to do everything by myself. I need your help boyo.

For example, I am having really difficult time finding a recursive formula for this problem. I need to solve it with O((log m) + n) memory (m = s and n = p). Could you please help?

View attachment 162275 View attachment 162276 View attachment 162277

I can do it in O(m * n), but I need to do with O((log m) + n). This is not a homework. I am practicing for my job interview.

I just need the recursive formula, that's all.
If you're doing a tabulation based approach and using a table of size (m+1)(n+1) then it should be clear you do not need to save the entire table in memory while you're building your solution. In fact, at any moment in time all you need are (n+1)ceil(log(m+1)) table cells to compute the next row of the table- as you only use the last table. This is due to the fact that the recursive structure is logarithmic when viewed as tree depth. It isn't always the case.

If you already have a working solution, it is trivial to go from O(mn) memory storage to O(nlogm) memory storage
Took the WAIS IV with a psychologist couple of years ago and scored 151 on verbal and 138 on spatial sections but only 124 on working memory and 120 on processing speed (suffer from ADHD and depression). For all intents and purposes, should I just base my intellectual and academic capacity on my verbal reasoning? Or is it cope to ignore my two weaker areas?

Never took WAIS IV but when you have geniuses like Feynman only scoring 130 on IQ tests it makes you wonder how accurate they really are
that makes sense. anyways what's the best way for someone to learn all this engineering and math for free? best websites or maybe cheap books recommendations?

I would suggest you have a definite goal of what you want to learn specifically
 
Can you do my very simple "simply supported beams" and some forces assignment for aero engineering I really can't be bothered to do?
 
Can you do my very simple "simply supported beams" and some forces assignment for aero engineering I really can't be bothered to do?

I don't want to. Why would I be doing your homework?
 
Bragthread.
High IQ and NEET.
I wish I could be like that.
You are born into the top 1% of lucky incels that have strong copes and the means and opportunities.

Me and others are at the bottom of the barrel with shitty wageslaving hours, shit university which is going bad due to low IQ and lack of motivation and an ever increasing responsibility to do things right by your family.

I envy your life.
 
Why do you feel compelled to lie on the internet?
 
If you're doing a tabulation based approach and using a table of size (m+1)(n+1) then it should be clear you do not need to save the entire table in memory while you're building your solution. In fact, at any moment in time all you need are (n+1)ceil(log(m+1)) table cells to compute the next row of the table- as you only use the last table. This is due to the fact that the recursive structure is logarithmic when viewed as tree depth. It isn't always the case.

If you already have a working solution, it is trivial to go from O(mn) memory storage to O(nlogm) memory storage

It's not solvable in O((log m) + n).

If you can, you are just going to violate many axioms in matroid and your explanations are just random gibberish.

Stop bullshitting. Enough of your larp. Now go home.
 
It's not solvable in O((log m) + n).

If you can, you are just going to violate many axioms in matroid and your explanations are just random gibberish.

Stop bullshitting. Enough of your larp. Now go home.

It absolutely is solvable in O(logm + n) storage, refer to this paper from Berkley to see why: https://www2.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-76.pdf

It requires O(mn) storage to solve using an NFA (which is equivalent to your logic) but can be solved using a lazy DFA in O(logm + n) storage
 
what's your ethnicity ?
do you think about suicide ?
what's your opinion on Elliot Rodger ?
 
It absolutely is solvable in O(logm + n) storage, refer to this paper from Berkley to see why: https://www2.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-76.pdf

It requires O(mn) storage to solve using an NFA (which is equivalent to your logic) but can be solved using a lazy DFA in O(logm + n) storage

There is an astronomical difference in O(mn), and O((log m) + n), wtf you are talking about.

Do you even understand what's the difference between O(m) and O( log m)? WTF.

Also that paper talks about a completely different problem. WTF.

You are not larping, you are just trolling at this point.
 
There is an astronomical difference in O(mn), and O((log m) + n), wtf you are talking about.

Do you even understand what's the difference between O(m) and O( log m)? WTF.

You are not larping, you are just trolling at this point.
You are a malicious actor in my thread who doesn't know what he is talking about. Earlier you claimed dynamic programming is different than recursion.

Now you are disregarding the paper from Berkley which proves me correct?

If you are so smart, how about you mathematically prove it is impossible to do in less than O(mn) storage? Hint: It isn't impossible, and the paper I linked shows a solution which uses O(logm + n) storage.
 
Has google created quantum supremacy? Are you into blockchain? Are there any new trends in tech that people are sleeping on?

Why don't you work in tech and destroy them from the inside? You could be a neo-ludite like Ted K but work from the inside.
 
Has google created quantum supremacy? Are you into blockchain? Are there any new trends in tech that people are sleeping on?

Why don't you work in tech and destroy them from the inside? You could a neo-ludite like Ted K but work from the inside.

Not following Google's quantum machine tbh.
 
You are a malicious actor in my thread who doesn't know what he is talking about. Earlier you claimed dynamic programming is different than recursion.

Now you are disregarding the paper from Berkley which proves me correct?

If you are so smart, how about you mathematically prove it is impossible to do in less than O(mn) storage? Hint: It isn't, and the paper I linked shows a solution which uses O(logm + n) storage.

Goddammit, that paper talks about a completely different problem that has no relation with the problem I posted.

Stop trolling man.

I made up that impossible O(log m + n) condition. Fuck.
 
No matter what a social loser you are, you must be able to achieve in other areas that society deems valuable. I swear that must lead to something good

I mean yes ideally you'd design a billion dollar app or website
 
Goddammit, that paper talks about a completely different problem that has no relation with the problem I posted.

Stop trolling man.
It is the exact same problem

Your alphabet ∑0 for p consists of 3 types of characters: ?, *, and . where . represents any other character other than '?' or '*'

This is basic theory of computation. To solve the problem (using dynamic programming) you're implementing an NFA. You can do it better by using a lazy-DFA mechanism instead, which is exactly what the paper talks about.

Clearly you are the idiot here, to not recognize this is the exact same problem.

The title of the paper even reads: "Fast and Memory-Efficient Regular Expression Matching for Deep Packet Inspection"

And the algorithm you programmed is a type of machine which accepts the regular language ∑ 1 consisting of the set of characters {a-z}

Are you this retarded to understand that you have essentially programmed something which accepts a subset of regular languages?


Get out of my thread, you dirty malicious curry
Also, for some icing on the cake, this tutorial I link here even tells you that you can do better than O(mn) storage. This is why everyone hates curries, you are a bunch of dirty liars and malicious actors.



Refer to here:
1572303917698


I told you exactly how to do that

And I even linked a paper which spoonfeeds it to you!
 
Last edited:
It is the exact same problem

Your alphabet ∑0 for p consists of 3 types of characters: ?, *, and . where . represents any other character other than '?' or '*'

This is basic theory of computation. To solve the problem (using dynamic programming) you're implementing an NFA. You can do it better by using a lazy-DFA mechanism instead, which is exactly what the paper talks about.

Clearly you are the idiot here, to not recognize this is the exact same problem.

The title of the paper even reads: "Fast and Memory-Efficient Regular Expression Matching for Deep Packet Inspection"

And the algorithm you programmed is a type of machine which accepts the regular language ∑ 1 consisting of the set of characters {a-z}

LMAO I made up that impossible O(log m + n) condition, randomly.

NO SUCH THING EXISTS.

You are now basically trying to prove 2 + 2 = 5 by citing some random papers that you have no fucking idea what they are talking about.

Stop it.
 
LMAO I made up that impossible O(log m + n) condition, randomly.

NO SUCH THING EXISTS.

You are now basically trying to prove 2 + 2 = 5 by citing some random papers that you have no fucking idea what they are talking about.

Stop it.

Unfortunately, that isn't how math and science works. You're making the claim is impossible, so mathematically prove it.

I've proven it is possible above. Go ahead, I'm waiting.
Even tutorials on Google say you are wrong!

1572304070508


Do better, curry troll. Do better!
 

Similar threads

SandNiggerKANG
Replies
140
Views
3K
Aquiline
Aquiline
comradespiderman29
Replies
68
Views
4K
Da_Yunez
Da_Yunez
R
Replies
64
Views
6K
prajeet88
prajeet88

Users who are viewing this thread

shape1
shape2
shape3
shape4
shape5
shape6
Back
Top