AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
The Problems of Traming and Sketching
In one example, you can prove that any deterministic alre don't use random ness. So if the number you're counting gets to be large, just remembering the number would consume k units of your memory. But if you allow for approximation, meaning when you ask me to report the value of the counter, i'm allowed to slightly err. That's an example of something i worked on. We just go preprint on this from the fall o less than a year ago.