1 definition by ReaderOfProofs
The favorite word of mathematicians and computer scientists alike. Used when they don't want to go into detail about a component of their paper or proof. Sometimes acts to discourage people from asking unwanted questions by making them feel stupid.
"While the Binary Indexed Tree is a data structure designed to implement dynamic cumulative frequency tables, efficiently answering range queries with point updates, given a static array, it is obvious that this is unnecessary, as the table can easily be generated by processing the array using a simple O(n) loop." -A Computer Scientist
by ReaderOfProofs May 11, 2016