![]() Our goal is to show that \(L = \^i\) must end up in a rejecting state. The term algorithm is synonymous to computer (and machine) and makes it more clear that we are not necessarily talking about a physical device. Note that even though the terms “computer” and “machine” suggest a physical device, in this course we are not interested in physical representations that realize computers, but rather in the mathematical representations. A computer is a specific instantiation of the computational model, or in other words, it is a specific collection of information processing rules allowed by the computational model. Given a computational model, we can talk about the computers (or machines) allowed by the computational model. However, there can be restrictions on how the information can be processed (either universal restrictions imposed by, say, the laws of physics, or restrictions imposed by the particular setting we are interested in).Ī computational model is a set of allowed rules for information processing. Anything that processes information can be called a computer.
0 Comments
Leave a Reply. |