Apparently you can't read either textbooks or wikipedia and understand it.
Also, wait, you're just a tutor and not actually a teacher? Being wrong about some incredibly basic thing in your field is one thing, but lying about that is just disrespectful, especially since you drop that in basically every sentence.
We've been at this point, I'm not going to explain this again. But you weren't able to read a single sentence of a wikipedia article without me handfeeding it to you, so I guess I shouldn't be surprised. I'm sorry for your students.
Yeah, doesn't mean that you know what an author is talking about when you encounter it doing actual math
The notation is not intrinsically clear, as any human writing. Ambiguous, one may say.
If you don't want to see why you're wrong that's your thing, but I tried. I can just say, try to re-read the math textbook you took pictures of, and try to understand it.
Exactly! It's in math textbooks, in both ways! Ambiguous notation, one might say.
I don't know what you're on about with your distributive law thing. That just states that a*(b + c) = a*b + a*c, and has literally no relation to notation.
And "math is never ambiguous" is a very bold claim, and certainly doesn't hold for mathematical notation. For some simple exanples, see here: https://math.stackexchange.com/questions/1024280/most-ambiguous-and-inconsistent-phrases-and-notations-in-maths#1024302
If it's networking related, I like "Layer 8 Issue"
It just goes up all the way
Depends one what you need to do, there are some areas in which adobe still has a monopoly
Well landau notation only describes the behaviour as an input value tends to infinty, so yes, every real machine with constant finite memory will complete everything in constant time or loop forever, as it can only be in a finite amount of states.
Luckily, even if our computation models (RAM/TM/...) assume infinite memory, for most algorithms the asymptotic behaviour is describing small-case behaviour quite well.
But not always, e.g. InsertionSort is an O(n^2) algorithm, but IRL much faster than O(n log n) QuickSort/MergeSort, for n up to 7 or so. This is why in actual programs hybrid algorithms are used.
Es kann sein, dass du nur die subs siehst, die auch auf deiner Instanz registriert sind
I'm not using logic in this case, you are just being insincere. Let me know when you bother to try to understand anything I or the authors of your holy textbooks wrote.