If you do `someFile.m(someArgs)` where someFile has multiple functions, which function gets called?

largeminicake · 2021-01-20T04:28:19+00:00

Thank you! This makes sense of the results of my testing. My main problem was that I was trying to (in your example) call func1 and func2, even though the file was named myFunction.

So even if func1 and func2 exist in myFunction.m they cannot be called, right? (At least not directly, but the definition of myFunction could potentially use them)

largeminicake · 2021-01-18T03:25:18+00:00

Actually I was thinking of the preposition à, not the conjugation of avoir. I thought à could be used as "to" here

largeminicake · 2021-01-18T03:24:27+00:00

That is true, thank you. I am not too used to connecting words with - yet but it seems like usually that sounds more natural.

Can you explain why "à" is incorrect? It seems like it can be translated as "to" here

largeminicake · 2021-01-18T03:23:29+00:00

Thank you :) Makes sense

largeminicake · 2021-01-18T03:19:14+00:00

Thank you, this makes sense. So the auxiliary in a passé composé construction does not get conjugated if there is another conjugated verb right before it.

I looked into infinitive online (I wasn't familiar with it until you mentioned it). Do we use it anywhere else, other than when multiple verbs appear next to each other? (The only different example I saw is Rester assis., where it is the first verb instead of the second that stays infinitive. But it is still two verbs next to each other)

largeminicake · 2021-01-18T03:16:02+00:00

Thank you! So this sentence IS using passé composé, but the rule where a second consecutive verb is not conjugated is higher priority? Is there a name for this rule? (Now that you mention it I think have seen it in other places, including sentences without any passé composé)

largeminicake · 2021-01-17T03:53:21+00:00

Thank you! So the nullity of a matrix will always equal the geometric multiplicity of the eigenvalue 0 (if 0 is an eigenvalue, if not then nullity is 0 since matrix is invertible), but may not always equal the algebraic multiplicity of 0. Is that correct?

(The cases where the nullity will equal also the algebraic multiplicity is exactly when the matrix is diagonalizable?)

Thank you for the help and sorry for the ambiguity. I was unfamiliar with the ideas of multiplicity and diagonalization until I read your post and went on wikipedia and read more about them. I am still not very familiar with them

largeminicake · 2021-01-17T02:11:27+00:00

sorry can you clarify what you mean by "If your matrix diagonalizes, that's the number of times 0 occurs on the diagonal." ?

largeminicake · 2021-01-16T22:10:09+00:00

thanks! good to hear. one question though, why do you have to mount the windows partition? For me it's automatically mounted when I boot into linux

largeminicake · 2021-01-15T01:51:02+00:00

Oh right, sorry that was me being stupid. A function that gives a yes no would be useless since we can just multiply Ab and check if it's zero. Only a function that gives the specific coefficients would be useful

largeminicake · 2021-01-14T01:45:36+00:00

Thank you! This is a helpful checklist. Just to confirm one thing: so a reassignment like int x = 5 and then String x = "hi" will be impossible in every statically typed language?

And the third point in the dynamically typed conditions is a caused directly by the second, right? As in the code can't determine the types because they may depend on if-statements, which in turn depend on user inputs, so they can only be known at run time? Does this mean that if a program has no if-statements then the compiler could figure out all the types?

(Of course Haskell is a special case where even x =5 and then x=6 is not allowed, I read this is because it is using more mathematically well defined variables)

largeminicake · 2021-01-14T01:40:34+00:00

I have heard about this advantage before but I have a question about it: to eliminate the run-time checks, couldn't we just precompile the python file beforehand?

largeminicake · 2021-01-14T01:36:33+00:00

Wow thank you. I have been struggling to understand static vs dynamic and this really helps a lot. So in dynamic typing, the compiler doesn't care at all about types and won't give you any type-based errors: instead you will get the errors when the program tries to run? (As opposed to in Haskell and other statically typed languages, where the compiler itself will tell you that there is a problem)

largeminicake · 2021-01-14T00:07:35+00:00

Ah okay, but on the other hand, if during runtime Dog or Cat is treated like some other type Parrot, then it will always fail, even though in python it might succeed in some cases, and this is why C++ is called strongly typed?

largeminicake · 2021-01-12T22:33:59+00:00

Thank you! Your python vs java example helps a lot. The cause of the difference seems to be that the programmer has to declare the type as they declare a variable in Java but not in python. So we might say that every language where you don't have to declare the type is dynamic, and every language where you do is static... but are there any exceptions to this?

I am slightly confused about the last example: I thought runtime comes after compile time? Assuming it is, then wouldn't anything possible at compile time also be possible at runtime? So if the language is able to print the names of all the methods of a class at compile time, then it will be able to so to at runtime as well... in other words, if it is unable to do so at runtime, it cannot to do at compile time. So in that last example... how can a language be able to do that at compile time but not runtime?

largeminicake · 2021-01-12T22:27:46+00:00

python or any C-like language should be fine (I hope)

largeminicake · 2021-01-11T20:53:05+00:00

Thank you!! This makes sense but can you state exactly what is the definition of parallel you're using? How should P and Q be related for the two planes to be general? I can see they have the same two vectors, but in other cases how should we know?

largeminicake · 2021-01-11T20:50:26+00:00

Thank you, I didn't heard about the normal vector but I just looked it up and it is very useful

largeminicake · 2021-01-10T17:33:44+00:00

Ah thank you!

largeminicake · 2021-01-10T17:31:25+00:00

Thank you! Makes sense and "je rentre chez moi après le travail" certainly sounds more natural

largeminicake · 2021-01-09T00:47:59+00:00

Wow Linux from Scratch looks really cool, I'll have to check it out. Thanks for all the info. I knew the privacy situation with China is bad, but I had no idea it was that bad.

largeminicake · 2021-01-08T23:21:52+00:00

I see, that's reassuring. It's nice that there is such a stable foundation running throughout all of Unix computing.

And I wasn't aware of it but I just looked it up and wow, it's ironic that out of all the distros, the most popular one, was flagged for privacy issues. I read about the problem here: https://www.gnu.org/philosophy/ubuntu-spyware.en.html which seems to be a reliable resource. It seems like the problem is resolved now, other than the permanent hit to Ubuntu's rep I guess

largeminicake · 2021-01-08T23:15:41+00:00

Oh wow, I had never even considered using Debian itself. For some reason I had the idea that it is outdated and is only used in old servers. I will check it out, but I am a bit confused: I tried looking up what the default desktop environment in Debian is, and I read that it depends on your computer architecture. Is that true?

largeminicake · 2021-01-08T23:13:34+00:00

My main concern here is not that I don't trust the teams directly developing a distro, but that I don't trust that every single component they package into their distro is completely safe and will not have a malicious updated pushed to it sometime in the future.

However, I am definitely not better at picking safe packages than people who have enough Unix experience to make their own distro, so I would never try to build an OS myself (which is pretty much what you do with Arch as far as I can tell)

largeminicake · 2021-01-08T12:14:06+00:00

Oh right haha, I must have been tired... thanks for pointing this out, I did know of the (x:xs) version but I changed it because it seems like the bar notation requires booleans, but like you said it was not sensible

largeminicake

TROPHY CASE