Ciro Santilli @cirosantilli 37

Complexity: NP-intermediate as of 2020:

The basis of RSA: RSA. But not proved NP-complete, which leads to:

The problem with a single-level paging scheme is that it would take up too much RAM: 4G / 4K = 1M entries per process.

If each entry is 4 bytes long, that would make 4M per process, which is too much even for a desktop computer: ps -A | wc -l says that I am running 244 processes right now, so that would take around 1GB of my RAM!

For this reason, x86 developers decided to use a multi-level scheme that reduces RAM usage.

The downside of this system is that is has a slightly higher access time, as we need to access RAM more times for each translation.

I think these are the ones where $\Delta H\times \Delta S>0$, i.e. enthalpy and entropy push the reaction in different directions. And so we can use temperature to move the Chemical equilibrium back and forward.

Richard Feynman's mentor at Princeton University, and notable contributor to his development of quantum electrodynamics.

Worked with Niels Bohr at one point.

Web of Stories interview (1996): www.youtube.com/playlist?list=PLVV0r6CmEsFzVlqiUh95Q881umWUPjQbB. He's a bit slow, you wonder if he's going to continute or not! One wonders if it is because of age, or he's always been like that.

Our examples are located under nodejs/next:

Solved ones:

This is perhaps the most popular version of Great doubt in 21st century China

Fuller quote as seen e.g. at: www.hrfjw.com/fjrw/hcrw/ywfs/324750.htmltranslation;k.sina.cn/article_5668613235_151e02c7300100wutq.html attributes it to modern day Chinese "Master Chongci" (崇慈法师).