RegisterMachines

RegisterMachines - Register Machines Computer Science...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Computer Science Department University of Central Florida Register Machines COP 6410
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Register Machines page 2 Register Machine Concepts A register machine consists of a finite length program, each of whose instructions is chosen from a small repertoire of simple commands. The instructions are labeled from 1 to m, where there are m instructions. Termination occurs as a result of an attempt to execute the m+1-st instruction. The storage medium of a register machine is a finite set of registers, each capable of storing an arbitrary natural number. Any given register machine has a finite, predetermined number of registers, independent of its input.
Background image of page 2
Register Machines page 3 Computing by Register Machines A register machine partially computing some n-ary function F typically starts with its argument values in the first n registers and ends with the result in the n+1-st register. We extend this slightly to allow the computation to start with values in its k+1-st
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 12

RegisterMachines - Register Machines Computer Science...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online