Everything Begins with Computation
Computer science deals with the issue of what can and cannot be computed and, if possible, how it can be computed. We refer to what a computer does, whatever it is, as “computation.” What to compute is formalized as a problem, whereas how to compute it is formalized as a mechanical procedure or an algorithm. What is defined as a field within which an algorithm works is a computational model. Once a computational model is defined, a set of basic moves that are performed is fixed as one step. Under these settings, the theory of computation is intended to uncover the laws that govern computation, as physical sciences discover the laws that control physical phenomena.
KeywordsComputational Model Turing Machine Finite Automaton Control Part Generative Grammar
- 7.G. Johnson, All Science Is Computer Science, The New York Times, March 25, 2001. Google Scholar
- 32.M. Minsky, The Society of Mind, Simon & Schuster, New York, 1985. Google Scholar
- 33.N. Chomsky, Syntactic Structures, Mouton, The Hague, 1957. Google Scholar
- 36.A. Maruoka and E. Takimoto, Algorithmic Learning Theory, Encyclopedia of Computer Science and Technology, Vol. 45, Dekker, New York, 2002. Google Scholar
- 37.S. Arikawa, M. Sato, T. Sato, A. Maruoka, and Y. Kaneda, Structure and Development of Discovery Science, Proceedings of the Institute of Artificial Intelligence of Japan, Vol. 15, No. 4, pp. 595–607, 2000 (in Japanese). Google Scholar