Loading...
Please wait, while we are loading the content...
Similar Documents
Simulation of a Turing Machine on a Digital Computer
| Content Provider | Semantic Scholar |
|---|---|
| Author | Coffin, Rs Aoheen, H. E. Stahl, Walter R. |
| Copyright Year | 1899 |
| Abstract | The theory of algorithms relies heavily upon the conceptual and theoretical usefulness of the Turing Machine. (1) Recent work by Trakhenbrot(2) has given further support to the hypothesis that "all algorithms can be given in the form of functional matrices and executed by the corresponding Turing Machines." Such a statement does not immediately suggest that all problems should be reduced to their equivalent Turing Machine, but the implication is clear that if certain problems, recognizable as algorithms, do not lend themselves to a solution in a formal logic structure, they may be reduced to a Turing scheme using a suitable strategy. Examples of such problems are revealed in the work by Lusted and Stahl (3) in the problem of medical diagnosis and by Stahl and Goheen (4) in simulation of the operation of biological cell systems. |
| File Format | PDF HTM / HTML |
| DOI | 10.1109/AFIPS.1963.81 |
| Alternate Webpage(s) | https://www.computer.org/csdl/proceedings/afips/1963/5063/00/50630035.pdf |
| Alternate Webpage(s) | https://doi.org/10.1109/AFIPS.1963.81 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
