It doesn't matter what you know or understand, if you show up to a Spanish class and give a lecture in French.
The whole point of this discussion is this exact thing. It's about what "knowing" and "understanding" actually mean. Your second sentence is nearly the post title verbatim: You can know a subject perfectly without being able to explain it. That's literally the difference between knowing and understanding.
“Also you have to be good at educating groups” doesn’t add anything meaningful IMO
So that might be:
- pure general diffusion just to make general society expectation broadly aligned and don’t waste too much time on topics closed since literal millennia, but repeating the basics is not avoidable and even never enough (earth is not flat)
- the audience become aware of the topic be it in the most over simplified manner with the hope that if they cross a situation where it could help to know that some knowledge body exists on the matter and could be possibly leverage on (GPS is possible only because general relativity is taken into account)
- the audience are aiming to become expert in a domain where this knowledge is known to be useful for practical purposes, though it needs actually just enough background to situate the useful tricks (studying some engineer level domain)
- the audience is expected to gain epistemological meta-critical knowledge on the topic, such that they don’t only become fraction of last decile most knowledgeable on the matter itself but also how it emerged through history and how this influenced the shape of the theory and are expected to be able to teach everything on the matter at that level as an outcome (a group of people all having 7 postdocs each all in distinct domains, I guess)
(not a closed category)
Practical things like computer vulnerabilities are pretty easy to explain. I think anyone I know could understand what a buffer overflow is and why it's bad. The computer is a dumb machine and clobbers whatever you tell it to.
Relativity and monty hall are much better examples, I think. Relativity is well-studied enough that the explanations available for teenagers are pretty good, and if you study them you can get a pretty comprehensive understanding. But you do have to study them. Both are vulnerable to a certain kind of passive understanding, where correct arguments and incorrect arguments can both sound equally convincing.
Not sure I agree with this. Maybe most people have a vague idea of an algorithm as "something a computer does". Most people I don't think would grasp that you can have fundamentally different algorithms to solve the same problem.
Phrase a search algorithm as finding out if a card exists in a deck of cards with the rule that you want to look at as few cards as possible is more likely to be useful than saying you have an array of data on a computer. (To be able to do this faster than "look at them all" you should probably also say the deck is sorted)
Most people do grasp arithmetic though, and I think you could easily describe a parallel in math to explain how there are different ways to get the same result
10+5=15
20-5=15 as well but subtraction takes longer for the computer to calculate
1+4+7+3=15 too with only addition but it has multiple steps so it takes longer for the computer to calculate
I think most people could draw a very rudimentary understanding of how algorithms take different amounts of time from that explanation
Then you can talk about how this optimal program behaves. If you double the size of the input (people can understand this in terms of file size), does the time double, or quadruple, or...? I wouldn't mind trying to explain NP to a lay audience. I think you could get it across pretty well.
You can probably do Monty Hall by enumerating all of the possibilities. There are only nine possible combinations of where the car is and which door you choose. The difficulty, I think, comes from overanalyzing the problem, and a simpler explanation actually makes the job easier.
Relativity is a goo example though. I don't understand relativity beyond the most superficial level. As far as I can tell, the teenager-level explanations of relativity are not right. They convey some aspects of relativity on a conceptual level, and even some basic things on a mathematical level, but they're omitting important aspects of it. You might read A Brief History of Time (or whatever your favorite explainer is) and come away with an understanding of relativity, but your understanding will be some combination of wrong and extremely incomplete.
I think that's the crux. If you don't get down to the level of your audience, it's sure to go over their heads (mixing metaphors here, but they seem apt). So, the article may have a point, but needs to change to "simple for your audience", indeed. But then the audience really needs to apply their intellect, too. At that point, you might just as well be educating your audience to understand the basics and a more complex vocabulary.
- The property of a problem being "easy to check, but not easy to solve" is an extremely useful one[0]. It's also not inherent to NP problems. Most problems that have this property are not NP.
- The explanation omits entirely a different aspect, that's closer to a characteristic of NP problems: that they're all equivalent to each other mathematically, so if you find an efficient solution for one, you found it for all of them.
--
[0] - Especially so in the age of LLMs, as it's almost a definition of "what LLMs can beat humans at today"/what we can reliably use them for.
Very roughly, P = "easy to solve", and NP = "easy to check whether a proposed solution is correct". All problems in P are also in NP. The P =? NP question is whether the reverse is also true. A problem is "NP-hard" if it's at least as hard (in some very particular sense) as every problem in NP, and it's "NP-complete" if it's NP-hard and also itself in NP. It's these NP-complete problems which are in some sense all equivalent to each other.
There are still a lot of technical details omitted here. To scratch the surface:
"Problem" aka "Language" = "yes-no questions about strings", so for example "is this string the base-10 representation of a square integer?" (in P, and therefore also in NP) or "does this string represent a square grid of numbers that's a Sudoku (generalized to allow larger grids than 9x9) with at least one solution?" (in NP, and in fact NP-complete). "Easy" = "there exists a deterministic Turing machine which correctly answers the question on every input, and always runs in a number of steps which is less than some particular polynomial in the length of the input string". (In the real world, though, "polynomial-time" is not the same thing as "easy".) A language L being NP-hard means that for any NP language M, there's a polynomial-time deterministic Turing machine which maps M-inputs to L-inputs, where yes-instances map to yes-instances and no to no. Swapping yes and no is not allowed. For NP problems you only have to be able to check solutions in poly-time if the solution indicates that the answer is "yes". The corresponding family where you can check "no" quickly is called co-NP, and it is believed that NP != co-NP. Etc etc etc.
And yet you haven't pointed it out. I'd recommend reading this blog post that mentions the limits and consequences of simplifications: https://nedbatchelder.com/blog/201711/toxic_experts
The connection to solution space is also iffy and usually not how people introduce or primarily think of NP.
All your claimed definitons imply that NP and P are disjoint which clearly isn’t the case. I would be more careful
If you truly understand something, I don't think it would pose a problem to explain it to a three year old using only vocabulary that the three year old knows.
Realizing you can't do that is realizing you do not truly understand something.
If explaining was all it takes to acquire knowledge, everyone leaving school would have a deep understanding about every subject.
There's a very common answer to this question: NP is the space of questions for which, when someone claims to have the answer, it's easy for you to tell whether they're right.
"Where are my keys?" - NP.
"Should I marry my girlfriend?" - not NP.
(Where "easy" is defined as polynomial time.)
I have yet to meet a single problem that when broken down to atomic parts wasn't trivial to grok. Every single piece of software. I am not saying 3 year old should understand details of general relativity, thats not the point.
> I have yet to meet a single problem that when broken down to atomic parts wasn't trivial to grok.
For one thing, we don't know how to break every problem down to "atomic parts". More seriously, the important things to grok in life are the things that are not atomic parts! If you look at quantum mechanics as a system of fancy mathematics with arbitrary rules, it is possible to become an unthinking machine that calculates outcomes. But that is not at all what it means to "grok" quantum mechanics! Likewise with relativity - it is very easy to have Lorenz transformations memorised but be totally unable to explain how e.g. the twin paradox works. Saying that's trivial to grok is utter BS.
NP = "Things that are easy to verify"
What you were thinking was probably the concepts of NP-hard or NP-complete.
Most of such problems are not NP.
4/5
2/5
1/5