technical terms when can we prove a lower bound on the amount of time that we need to solve a problem or the amount of resources needed to be consumed in order to solve a problem so so this sort of lower bound thing versus algorithms think it's going to be pretty prevalent this talk so here are some intuitions about theory that you build up again as a young computer scientist you learned that the elegant design and the complexity theorists have opposing goals and tasks okay certainly the way I presented it I mean one is trying to say