Posts by bluebadger112

Drew Ross2 said:—so how exactly did you link that to the SurveyMonkey? 😁

Just an analogy.

wanderingcanyon61 said:😁 I honestly think you just don't know how to handle all this attention—it's a lot. 😳 😁

🤣 For sure.

silverwalker6 said:I took that SurveyMonkey way too seriously—literally. Just for the record, Mianci is my absolute favorite, and I mean that with zero hidden motives. 🍿

:::
Are you sure the kid actually has a disability? Being quiet, keeping to himself, or even getting picked on by other kids—whether he ignores them or not—doesn't necessarily mean he's behind. It could easily be the exact opposite. 😁

I'm not so sure—it might only look fake if he's putting on an act. It's weird how he's so unapologetic about talking nonsense while everyone else just encourages him—feels like there might be some shady deal going on behind the scenes.

wanderingcanyon61 said:🤣 Are you actually being an idiot here? 😳

That’s how it looks—even if I’m just making an analogy.

And I’m not even worked up about it, just interpreting things. Correctly, obviously.

silverwalker6 said:Voting for Mianci 🙂

This is just a joke poll—the "most interesting" person is basically whoever everyone else ignores. 😁 It reminds me of this little playground in my neighborhood where kids hang out, and there’s always that one kid everyone picks on.

If this were an actual poll, you'd definitely have my vote 😉

Just some anonymous virtue signalers ☕

I’ve got a vote to cast—and I haven't even hit the poll yet🙂

Who's my favorite lady on this forum? Easy as Pie: Duxi 🥳 But she isn't even listed in the survey. So, forget the poll—let's just settle it right here 😳

It’s not really a question here—more like just making a statement about someone. So, you just end it with a period. ☕

OT: You're already ☕

Boosting my immune system by jamming a fork into a wall outlet

Basically just the reverse of a Shout Out. We post something about a member, and then someone else jumps in to guess who we're talking about.

OT: They’ve got 16 sticks left before they hit the garden ☕

wanderingheron9 said:man, I bet they'll be all about yoga after this one 😲
https://www.facebook.com/KoreanRoofS...7605232618228/

Oof. And naturally, there’s always that one comment: "based." 🤣 If the guy is hot enough, she'll probably end up apologizing to him anyway. ☕

🧐

😍 😬

There's also the extended version—sociologists think they're psychologists, psychologists think they're biologists, biologists think they're chemists, chemists think they're physicists, physicists think they're God, and God thinks He's a mathematician.

Hey there

It won't. And hey, let's not clutter things up with random spam—just get the job done ☕

Admins can go ahead and delete if they need to. Does this forum even have an option to just wipe my own user account? 🤔

Hey, check this out 🙂

Henry Evans10 said:I've never been much of a theory person—just here for the coding, man.🙂

Look, you don't have to love it, but you definitely need to understand it.🙂 You’ve got to know the details behind the algorithms you're using in whatever language you're writing in. Is it actually an algorithm? Does it even solve the problem at hand—you know, correctness? That's the baseline. If you can't prove it works, you haven't really mastered it. Plus, there's performance, efficiency, and whether a better way exists... all that matters.

Everything's cool—Assembly ++. Hacking is basically just a social construct.

You’ve got a lower opinion of those women than their own husbands do 🙂

My godmother says the secret to making things last is leaving the keys in the ignition 🍿

👋 Lu 😍 northernviper4, I'll get back to that once I dig up some more info 🙂

Here's a fix for that whole jealous husbands problem across 11 river crossings—I just winged this one, so I'm not 100% sure if it's the absolute most efficient way 😳 . S is the starting bank, C is the destination, W is the wife, M is the husband, () is the boat, the arrow shows direction, and the number k denotes the state after the k-th crossing. White color:

0. S: W1, W2, W3, M1, M2, M3. C:.

1. S: W3, M1, M2, M3. (W1, W2)-> C: W1, W2.

2. S: W2, W3, M1, M2, M3.
3. S: M1, M2, M3. (W2, W3)-> C: W1, W2, W3.

4. S: W1, M1, M2, M3.
5. S: W1, M1. (M2, M3)-> C: W2, W3, M2, M3.

6. S: W1, W2, M1, M2.
7. S: W1, W2. (M1, M2) -> C: W3, M1, M2, M3.

8. S: W1, W2, W3.
...

Only three obvious crossings left 🙂

Quick question: why do carrots last longer if you don't wash them and just leave the dirt on there? 🍿

northernviper4 said:Alright, so now we've officially hit the green zone. 🙂
Math vs. CS terminology 😁
That's actually an interesting question—never really thought about it before. What would be the common thread between problems that share that kind of solution? 🤔 Maybe there are some papers out there. Do you have access to any academic databases?

I do, but I honestly think you'd find the answer on Stack Exchange first—it’s such a natural question that someone's bound to have asked it. Back in the day, there was this guy on the forum, Melkor, who specialized in theoretical computer science—he could have answered this in his sleep.

The common factor in all those problems is that each one has its own (asymptotic) optimal solution. You could even refine that—like, some where the solution is actually constructible, while for others, you can just prove that an optimal solution exists even if it's impossible to actually build it. There's also the possibility of problems where you can prove it's impossible to determine if an optimal solution even exists. It's all about classification.

Anyway, maybe we should start an extreme geek debate about this—it feels a bit off to keep it here since we're supposed to stay on topic. 🙂 The thing is, I doubt the mods would want to open a new thread or move interesting posts from here over to a different section. 😳 ☕

2) 😁 More specifically—using the notation I pulled here—is it true that for any solvable "problem," there's an algorithmic O(f) solution where every possible solution to that problem is also at least Ω(f) (per Knuth’s Ω)? For instance, sorting $n$ objects has an $f(n) = n \log n$ solution, while summing the first $n$ integers is just $f(n) = 1$...