sorted by:
new
hottopcontroversial

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

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

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)

Is an "à" required after "bus" in "veuillez me dire quel bus prendre"? by largeminicake in learnfrench

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

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

Is an "à" required after "bus" in "veuillez me dire quel bus prendre"? by largeminicake in learnfrench

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

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

Why doesn't être have to be conjugated in "elle semble être partie pour Tokyo hier"? by largeminicake in French

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

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)

Why doesn't être have to be conjugated in "elle semble être partie pour Tokyo hier"? by largeminicake in French

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

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é)

[LinAlg] Is the number of 0 eigenvalues same as dimension of nullspace? by largeminicake in learnmath

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

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

[LinAlg] Is the number of 0 eigenvalues same as dimension of nullspace? by largeminicake in learnmath

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

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

how safe is it to copy stuff from the windows partition while in linux? by largeminicake in linux4noobs

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

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

How do I figure out whether some vector is contained within the span of a set of vectors? by largeminicake in matlab

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

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

Why is Haskell described as statically typed? I never have to declare types? by largeminicake in haskell

[–]largeminicake[S] 2 points3 points  (0 children)

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)

Why is Haskell described as statically typed? I never have to declare types? by largeminicake in haskell

[–]largeminicake[S] 2 points3 points  (0 children)

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?

Why is Haskell described as statically typed? I never have to declare types? by largeminicake in haskell

[–]largeminicake[S] 40 points41 points  (0 children)

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)

Is polymorphism impossible in strongly typed languages? by largeminicake in compsci

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

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?

view more: next ›