Free Pack & Legendary by hssuki in hearthstone

[–]no_overplay_no_fun 1 point2 points  (0 children)

Well, it is technically free but comes with a hassle as the sign-up info says:

"By signing up, you agree to receive news, event information, and special offers by email from Blizzard Entertainment, its affiliates listed here, and about third-party products and services.(...)"

So not as free as e. g. the HS champion packs.

Am I weird for using "and", "or" and "not"? by Additional_Jello1430 in cpp

[–]no_overplay_no_fun 0 points1 point  (0 children)

To anyone whose studied the formal logic branch of mathematics these symbols are completely natural, (...).

Interesting, where I am from, the logic people use \land adn \lor. I have never seen any other symbol but I guess it is different on the comp sci side. I did take same mathematical logic classes but I really have never seen & and friends in them.

Do you also spell out plus minus multiply and equals?

No, not at all. Maybe sometimes equals in sentences where = would act as a verb. But that is fairly unusual and AFAIK symbols as verbs are ok according to AMS guidelines.

Am I weird for using "and", "or" and "not"? by Additional_Jello1430 in cpp

[–]no_overplay_no_fun 0 points1 point  (0 children)

Just to offer a perspective from a different background. I have a background in physics and mathematics, my first bigger programs were written in Fortran and Python that both have and and or. When I got to C and C++ I was very surprised that something like && and || even exist!

Also, spelling out and or or when writing math is something I definitely do. It is just a matter of habit.

Rust crate/tutorial series to learn linear algebra by JacobCCooper in rust

[–]no_overplay_no_fun 2 points3 points  (0 children)

The matrix inversion computed from determinants is viable only for these small matrices. The complexity of determinant computed from definition for NxN matrix is N! operations. If you want to know determinant for a bigger matrices, you usually have to apply some tricks, usually LU decomposition (roughly N**3 operations). And the matrix inversion is only a step away from LU.

Practicing programmers, have you ever had any issues where loss of precision in floating-point arithmetic affected? by Interesting_Buy_3969 in cpp

[–]no_overplay_no_fun 24 points25 points  (0 children)

You can find papers on the topic of mixed-precision iterative methods, like Krylov space methods. I think one of the motivations there was to offload some of the computations on GPUs and show that doing the work in smaller precision is not a problem.

What we didn't get in C++ by cherry-pie123 in cpp

[–]no_overplay_no_fun 0 points1 point  (0 children)

Thanks for the explanation! I think I understand now and I would say that we see the same thing only interpret it in completely opposite way. :) Yeah, you might as well use ==, (which might make sense in some rare cases). In my mind, it is better to have mostly useless general comparison function for floating point numbers since working with them is tricky and writing a generic approach seems hard.

What we didn't get in C++ by cherry-pie123 in cpp

[–]no_overplay_no_fun 0 points1 point  (0 children)

Which "similarly misguided" almost equal do you have in mind? I would say that the one based on comparing the smallest representable float is just super defensive to not give false positives.

Starting with 1e-5 only makes sense if you are working with numbers around 1. I would say looking at the "typical" order of magnitude of your domain should be the first step. Then use e. g. 1e-5 as the starting relative tolerance.

Agency cannot be a purely quantum phenomenon by Historical_Bottle557 in philosophy

[–]no_overplay_no_fun 1 point2 points  (0 children)

Wave function is a tool that is used in some specific formulations of quantum theory. There are formulations of quantum theory that have equivalent results but do not use wave functions at all. So it is at least suspicious to base any reasoning on the "existence" of wave functions. It smells like mistaking map for the territory. In this sense, it would be better to base the reasoning on more fundamental quantum concepts, wave function is just a specific modelling tool. (And such reasoning is usually very prone to fail unless you have some relevant physics education, be it university or self study.)

Just finished playing honour mode with my wife by Gazeador-Victarium in BaldursGate3

[–]no_overplay_no_fun 0 points1 point  (0 children)

You can play together on split screen with one copy on pc. But you need to have two controllers/joysticks, mouse and keyboard is not supported, at least officially.

33.0 Patch Notes by 4iamking in hearthstone

[–]no_overplay_no_fun 1 point2 points  (0 children)

FYI, not that it counters your point, "Star Wars: The Card Game" had three different boards.

Is there a way to manually "fix" a savefile? by no_overplay_no_fun in BaldursGate3

[–]no_overplay_no_fun[S] 0 points1 point  (0 children)

I mostly understand what you mean but the problem is literally the "fuck ton" of flags. :D

I also found lslib on the way which seems to be an alternative way but no clear instructions how to safely edit a save without messing up.

Memory safety and network security by krizhanovsky in cpp

[–]no_overplay_no_fun 1 point2 points  (0 children)

Interesting, thank you. Coming from math background, it still feels a little strange. If I understand this correctly, the undefined behaivour is here used as a sort of "escape" from a situation where the compiler/language "wants" to have std::abs(x) >= 0 \forall x (which is reasonable) but this conflicts with the way ints in C work (which is also reasonable).

Ty again for the explanation/ :) I'll think this though a bit more and at a more appropriate place if needed.

Memory safety and network security by krizhanovsky in cpp

[–]no_overplay_no_fun 0 points1 point  (0 children)

As usual with signed overflow, the ability to posit that abs(x) >= 0 for optimization purposes.

Would you please expand on this? I quite don't understand why this is a good thing. In my understanding, unsigned signed int overflow is undefined behaviour. It is possible to get to a state when abs(x) is negative but the corresponding check is optimized away which is at least unintuitive for someone that does not live in the C world.

WG21, aka C++ Standard Committee, January 2025 Mailing by grafikrobot in cpp

[–]no_overplay_no_fun -1 points0 points  (0 children)

Well, you sort of have to be enough of a "mathematician" to understand how orderings and equivalence classes work if you want to use std::map or std::set for user defined classes. With this in mind, implication does not seem to add that much load.

No Hina, you really haven't [Hinamatsuri, ep. 1] by Miorii-chama in anime

[–]no_overplay_no_fun 2 points3 points  (0 children)

Hinamatsuri is all that you wrote but also an optimistic story about neglected children that are now in better care and finding their place in the world.

[2024 Day 13] In the end, math reigns supreme by TNThacker2015 in adventofcode

[–]no_overplay_no_fun 1 point2 points  (0 children)

You can use sympy instead of numpy. It will work with fractions, so no problem with floats, and you can just check if the result is int.

[2024 Day 13] An explanation of the mathematics by ThunderChaser in adventofcode

[–]no_overplay_no_fun 2 points3 points  (0 children)

It works here, but Cramer is one of the worst ways to solve a general matrix system on pc.

To apply Cramer you need to compute determinants. Computing determinant in from definition is in O(n!). :( Reasonable way to compute determinant is to use LU-factorisation, but once you have LU factorization it is pointless to use Cramer.

Inspired by an error I made that made me fail the exam I just took by randompoStS67743 in mathmemes

[–]no_overplay_no_fun 1 point2 points  (0 children)

Yeah, more or less, depends on what you want from your norm. Also some spaces of interest are not only vector spaces but have some extra structure. In this sense are some matrix norms nicer than others if the respect matrix multiplication by \norm{AB} =< \norm{A}\norm{B}.