## Computer Science: An Overview |

### From inside the book

Results 1-3 of 17

Page 414

Figure 1 1-3 An actual machine compared to a

Abstract

infinite number of cells organized row with each cell containing one of

sequentially on ...

Figure 1 1-3 An actual machine compared to a

**Turing machine**Actual machineAbstract

**Turing machine**Memory: A finite number of cells organized in a Aninfinite number of cells organized row with each cell containing one of

sequentially on ...

Page 420

One uses

Bones programming language. The important point is that researchers have

shown that the two are equivalent. That is, any function that can be computed by

a Turing ...

One uses

**Turing machines**and the other uses programs written in our BareBones programming language. The important point is that researchers have

shown that the two are equivalent. That is, any function that can be computed by

a Turing ...

Page 437

Chapter 1 1 Review Problems Appendices Appendix A: Popular Codes Appendix

B: A Typical Machine. 1. Show how ... The example of a

never halts given in the text used the fact that the tape was infinitely long. Design

a ...

Chapter 1 1 Review Problems Appendices Appendix A: Popular Codes Appendix

B: A Typical Machine. 1. Show how ... The example of a

**Turing machine**thatnever halts given in the text used the fact that the tape was infinitely long. Design

a ...

### What people are saying - Write a review

User Review - Flag as inappropriate

sa

### Contents

Contents | 1 |

PART ONE Machine Architecture | 19 |

Data Manipulation | 61 |

Copyright | |

8 other sections not shown

### Other editions - View all

### Common terms and phrases

abstract data type activities actually addition algorithm application application software array ASCII assign binary bit patterns block bulk storage byte called Chapter COBOL concept consider consists contains current entry Current Pointer data types database declare search deleted devices diagram discussed disk employee example execution Figure goal hash head pointer hexadecimal identified implemented input insertion sort instruction integer key field linked list loop machine language machine's memory main memory memory cells modified module move notation operating system organization password perform pivot entry position problem produce program counter programming languages pseudocode Questions/Exercises queue record represented request result retrieve routines search tree Section segment sequence sequential file solution solving sort algorithm stack statement step storage system stored string subprogram syntax tape target value task technique terminal Turing machine two's complement