Theory of computing in computer science education

  • Authors:

  • Patrick C. Fischer

  • Affiliations:

  • University of Waterloo, Waterloo, Ontario, Canada

  • Venue:
  • AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
  • Year:
  • 1971

Quantified Score

Hi-index 0.00

Visualization

Abstract

Theory of computing means the abstract study of the nature of computation and computing devices. By convention, the terminology is usually applied in a narrower sense to exclude numerical analysis. Thus, theory of computing includes the theory of finite automata, formal languages, computability, computational complexity, and some aspects of switching circuit theory and logical design. The deviation from the literal meaning of the term may have occurred because numerical analysis was already a well-established subject when the other components of this area were in their infancy. On the other hand, it may be a reflection of the emphasis on discrete mathematics by workers in theory of computing, in contrast to the preponderance of continuous methods in numerical analysis.