With no explanation, label text_A→text_B with either "DON'T KNOW", "NO" or "YES".
text_A: In academic cryptography, a "weakness" or a "break" in a scheme is usually defined quite liberally: it must require practical amounts of time, memory, or known plaintexts. However, it also might require the attacker be able to do things many real-world attackers can't: for example, the attacker may need to choose particular plaintexts to be encrypted or even to ask for plaintexts to be encrypted using several keys related to the secret key. Furthermore, it might only reveal a small amount of information, enough to prove the cryptosystem imperfect but too little to be useful to real-world attackers. Finally, an attack might only apply to a weakened version of cryptographic tools, like a reduced-round block cipher, as a step towards breaking of the full system.
text_B: If an academic finds that a scheme can be thwarted, but requires an amount of memory equal to all the computers currently operating , would they call this a weakness in the scheme?
NO.