Loading...
Please wait, while we are loading the content...
Similar Documents
Computational complexity of multitape turing machines and random access machines
| Content Provider | Semantic Scholar |
|---|---|
| Author | 琢美, 笠井 |
| Copyright Year | 1977 |
| Abstract | In recent years there has been an increasing interest in analyzing the computational complexity of programs. The multitape Turing machine has become the standard model used for evaluating time and storage complexity, even though such machines are not much like any existing computers. Some authors, however, implement their algorithms not on Turing machines but on random access machines. In 1972 Cook introduced a formal model of a random access machine. This model is closer to real computer, for real computers calculate the address of desired storage cell within a short time before fetching its content. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.ems-ph.org/journals/show_pdf.php?iss=2&issn=0034-5318&rank=5&vol=13 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
