In this paper, taking an algorithmic viewpoint, we explore the differences existing between the class of non real-time computing problems (ℵℜ) versus the class of real-time computing problems (ℜ). We show how a problem in class ℜ can be transformed into its counterpart in class ℵℜ. Claims of real-time behavior made for solutions to problems in class ℵℜ are examined. An example of a distributed computing problem arising in class is studied, along with its solution. It is shown why off-line strategies or scheduling algorithms that are not driven by real-time/timeliness requirements ℜ are incorrect for class ℜ. Finally, a unified approach to conceiving and measuring the efficiency of solutions to problems in classes ℵℜ and ℜ is proposed and illustrated with a few examples.