
	Where results make sense

Topic: Register machine

Related Topics

Projective special linear group

Class field theory

Virtual private network

1862 in architecture

Bisexual pride flag

Richard Hawley

Kozu Station

Johnny Wakelin

High School for the Performing and Visual Arts

Sud Express

Timothy Dwight

In the News (Tue 9 Feb 10)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Register machine - Wikipedia, the free encyclopedia
		In theoretical computer science a register machine is an abstract machine used to study decision problems, similar to how a Turing machine is used.
		Register machines are also sometimes called counter machines (because the registers act like counters), Minsky machines (because they were introduced and developed by Marvin Minsky), or program machines (this being what Minsky called them).
		The computational power of register machines is equivalent to that of Turing machines, although due to their unary processing style, register machines are typically slower by a factor that is exponential in the space used by the comparable Turing Machine.
	en.wikipedia.org /wiki/Register_machine (226 words)

	Random access machine - Wikipedia, the free encyclopedia
		In computer science, random access machine (RAM) is an abstract machine which has an unlimited number of registers (in contrast with a register machine, which has a finite number of registers) of unlimited size which can be accessed randomly.
		Then, there is a program which is run step-by-step and consists of a limited number of instructions out of a simple instruction set (similar to the assembly language).
		The input of the machine consists of zero or more natural numbers (normal case) and the output is one natural number, or nothing if it does not terminate.
	en.wikipedia.org /wiki/Random_Access_Machine (146 words)

	Squawks of the Parrot: May 14, 2003 Archives
		Generating code for a register machine is a bit tougher, unless you're treating it as a stack machine with an accumulator.
		For a register machine you're adding the register number to the register file base address to get an effective memory address, and for the stack machine you're loading indirectly from the stack pointer address, then incrementing or decrementing that pointer and storing the difference.
		The register case saves in memory activity a bit, as there's no need to store the result, while the stack machine has to store the result, but on the other hand the register machine needs more bandwidth to get the register numbers into it, something that's implicit for the stack machine.
	www.sidhe.org /~dan/blog/archives/2003_05_14.html (1377 words)

	CS 231 Supplement: Programming the PC-231 Computer
		The PC-231 machine has 16 internal registers, which are referred to in several ways, including a "raw" binary or hexadecimal ordinal or a special mnemonic code as used in the standard assembly language.
		Several I/O devices may be attached to the machine, each with its own protocol and uses: for now, we will assume 3 standard devices for each of input and output, supporting direct reads and writes of decimal, hexadecimal and ASCII values, respectively (we may add a fourth device for color graphics later on).
		The register is filled with zeros on the other side as bots are moved out (and lost) on the side of the specified direction (given by s).
	www.willamette.edu /~fruehr/231old/pc231.html (3216 words)

	LMI K-Machine (Site not responding. Last check: 2007-10-16)
		As mentioned previously, the output of the register file is latched and presented to the inputs of the ALU.
		Thus the primary data paths in the machine are composed of a two-stage pipeline.
		The pipeline registers are frozen; the clock for the pipeline is temporarily disabled.
	home.comcast.net /~prunesquallor/kmachine.htm (5986 words)

	Squawks of the Parrot: Registers vs stacks for interpreter design
		Beyond that the problem is that most compiler literature and research targets register machines since that's what the hardware is, and any stack stuff is generally dealt with as part of the HIR or AST the parser builds.
		Well, an intermediate stack result can be though as a register that can be assigned just once, while in the register machine you have to scan all the code in the method to check if the value in the register is overwritten...
		JITting for a register-rich machine is, with a register-rich IL (Which one could consider a register based VM, the same way that a stack-based VM is a stack IL), is relatively easy, in part because a lot of the optimization decisions have been made, and in part because less information has been lost.
	www.sidhe.org /~dan/blog/archives/000189.html (2690 words)

	C:\BELLBO~1\COMPUT~1\HTMFILES\00000409.HTM (Site not responding. Last check: 2007-10-16)
		A general register machine provides the greatest performance, and the cost (in terms of bits) is the same as when used as a stack machine.
		While a stack is the natural (and necessary) structure to interpret the nested block structure languages, it does not necessarily follow that the interpretation of all statements should occur in the context of the stack.
		In effect, appropriate assignment allows a general register machine to be used as a stack machine for most cases of expression evaluation.
	research.microsoft.com /~gbell/Computer_Engineering/00000409.htm (535 words)

	Math 10 -- Notes N24
		The simplest type of machine language to look at is the 0-address paradigm, which is the type of machine that many programmable calculators are like.
		One register machines are also called "accumulator" machines because of a register which "accumulates" the values similar to the display on a pocket calculator.
		In the simplest form of such a machine, all arithmetic work is done in the accumulator and all storage passes through it.
	math.scu.edu /~dsmolars/newma10/notesn24.html (1089 words)

	Igblan Cellular Automata
		A picture of a working Minsky Register Machine modelled using a 4-state Moore CA in which the centre cell, orthogonal neighbours, and diagonal neighbours, are summed separately.
		The value of a register is the distance of a single memory cell from its left hand side.
		A register is capable of performing two instructions, each sent as a single leftward-travelling pulse on a different track.
	www.igblan.free-online.co.uk /igblan/ca/camrm.html (708 words)

	A Register-Machine Simulator
		In order to gain a good understanding of the design of register machines, we must test the machines we design to see if they perform as expected.
		In this section we construct a simulator for machines described in the register-machine language.
		The first uses a description of a register machine to construct a model of the machine (a data structure whose parts correspond to the parts of the machine to be simulated), and the other three allow us to simulate the machine by manipulating the model:
	mitpress.mit.edu /sicp/full-text/sicp/book/node112.html (371 words)

	[No title] (Site not responding. Last check: 2007-10-16)
		They will hand-craft register machines for them, EC-eval the Scheme code, compile the Scheme code, and compare the resources in these cases.
		The idea is each line can only (a) transfer data from one register to another through some operation, (b) test, or (c) branch or goto a label.
		It is probably a good idea to set up ahead of time the contracts that each of the pieces of eval and apply rely on, then show how the chunks of code are basically oriented towards achieving those contracts.
	www-swiss.ai.mit.edu /classes/6.001/FT98/staff/weeks/week11.txt (529 words)

	Localized Register Spilling - GNU Project - Free Software Foundation (FSF) (Site not responding. Last check: 2007-10-16)
		GCC's register allocators attempt to pack pseudo registers, which are potentially unbounded in number, into the register set provided by a particular target machine.
		Pseudo registers which have non-overlapping lifetimes may be allocated to the same machine register.
		If the register spilling/reloading pass of the compiler needs a particular machine register for a reload, then pseudos allocated that that machine register may need to be spilled (ie, deallocated from that machine register and either reassigned to another free register or moved into the stack).
	www.gnu.org /software/gcc/news/spill.html (464 words)

	[No title] (Site not responding. Last check: 2007-10-16)
		draw the data paths for a square root machine.
		+ f(k) where k is an additional input register ------------------------------------------------------------------------ * write the register machine code to compute list-ref. assume the inputs are in register lst and k, and the output should be stored in register result.
		draw the data paths and write a controller to implement this as a register machine.
	people.csail.mit.edu /bmcutler/6.001/S04/recitation_24.txt (188 words)

	Processor Architecture (Site not responding. Last check: 2007-10-16)
		Some general register machines use one of their general registers as stack pointer.
		Size: In most machines the size of general registers is the same as the size of the ALU.
		Slow: Stack machines are slow, because the most frequently used operands are stored in main memory rather than CPU registers.
	www.qu.edu.qa /eng/503263/processor_architecture.htm (740 words)

	What is so bad about compiling? \| Lambda the Ultimate (Site not responding. Last check: 2007-10-16)
		From working with several virtual machines including a Lisp vm I have concluded that the machine, or the vm as the case may be has more to do with the properties of the language than the language itself.
		You aren't talking about the difference between compilers and virtual machines, you are talking about the difference between target languages; one of which is a register machine, and another of which is some sort of virtual machine.
		Looking at it from another perspective, if you could show that there was some limitation of register machines that prevented a particular computational language, or type of language, from being compiled to those machines, you would have a result of similar significance to those of Turing.
	evil-wire.luvfeed.org /cache/3864 (3093 words)

	The Machine Model
		to construct the parts of the machine model that are common to all register machines.
		First it allocates a register in the new machine for each of the supplied register names and installs the designated operations in the machine.
		register is used to control branching in the simulated machine.
	mitpress.mit.edu /sicp/full-text/sicp/book/node113.html (636 words)

	[No title] (Site not responding. Last check: 2007-10-16)
		But larger physical registers simultaneously introduce their own stresses on a system — larger register files incur longer access times which in turn may require pipelining the register file, which is non-trivial [4]; and large physical registers can become access bottlenecks unless more ports are added, which add a non-linear cost to the hardware.
		Thus, the physical register file no longer needs to hold the complete state of the machine — instead it can hold the values needed for execution of the current instruction window, and the other values are held in the memory system.
		This implies that 128 registers is sufficient for decent performance —increasing the register file size beyond that point cannot reduce the number of fetches and writebacks because those that remain are a result of the inherent natures of the benchmarks, and not because of a lack of physical registers.
	www.eecs.umich.edu /~seokwoo/doc/A_Reduced_CPU_State_Machine.doc (4170 words)

	Minsky register machine -- Facts, Info, and Encyclopedia article (Site not responding. Last check: 2007-10-16)
		The Minsky register machine is a type of theoretical computing device.
		It is named after (Click link for more info and facts about Marvin Minsky) Marvin Minsky, author of (Click link for more info and facts about The Society of Mind) The Society of Mind.
		A Minsky register machine has a finite number of registers, each of which can hold any positive integer, and three instructions - an instruction to add 1 to a specifed register, an instruction to subtract one from a specified register and branch if it becomes zero, and a halt instruction.
	www.absoluteastronomy.com /encyclopedia/m/mi/minsky_register_machine.htm (131 words)

	6.001 - Recitation #23 - Wednesday, 5/1/96
		Both the operation and the test box may in fact be implemented as additional register code.
		register to indicate where to go when done, and use the stack to keep track of our recursion.
		For example, we could arrange that the subroutine which is called is responsible for saving on the stack the values of any registers which that subroutine is going to touch, and then must restore the stack when all done.
	www-mtl.mit.edu /users/boning/ST96/rec23/rec23.html (458 words)

	Deus Ex Machina - Register Machines Help File (Site not responding. Last check: 2007-10-16)
		Setup the machine diagram by adding some register and branch instructions then connect them as needed.
		As shown when defining a new machine you can decide how many of the registers should be initially visible in the register set window and also if your machine will use tapes or not.
		A register machine that uses tapes has 2 tapes: input tape and output tape.
	www.ics.uci.edu /~savoiu/dem/register (288 words)

	Igblan - Minsky Regsiter Machine
		A Minsky Register Machine (MRM) comprises a finite number of registers, a finite state automaton (FSA) embodying the instructions, and an initial state.
		When (and if) the machine halts, the result of the computation is found in some of the registers (conventionally in register 0).
		The VMRM specification and initial register contents are encoded as the initial values of six registers of the Life URM.
	www.igblan.free-online.co.uk /igblan/ca/minsky.html (859 words)

	[No title] (Site not responding. Last check: 2007-10-16)
		A register machine contains a a number of general purpose registers which usually contains the value of argument of an instuction and is also the destination of an operation.
		The mathematical formalism is used to note changes in values that occur to the registers, the data store, the program counter and the input and output devices.
		The machine repeatedly fetches the instruction at the address in the PC, increments the PC and executes the instruction and stops when the the halt instruction encountered.
	cs.wwc.edu /~aabyan/LABS/AR/Sparc.html (371 words)

	Simulation of a 16-Register Machine
		Load the Register R with the SUM of the hex number XY and the contents of the index register F. LOAD the register R with the contents of the memory cell whose address is XY.
		STORE the contents of the register R in the memory cell whose address is XY.
		READs the contents of the Enter Data text field into the register R. This and the next instruction WRITE are new opcodes that this implementation added to the Brookshear machine.
	www.acs.brockport.edu /~trao/csc120/Machine3.html (656 words)

	The Halting Problem (Site not responding. Last check: 2007-10-16)
		Theorem: The halting problem is undecidable: there is no register machine, H, such that H(p,d) = 1 iff p(d) halts and H(p,d) = 0 iff p(d) does not halt (and H always halts).
		There are several variants on the halting problem, including the zero-input halting problem (does machine p halt with zero input) and the uniform halting problem (does machine p halt for all inputs?).
		The machine M works by analyzing the program p to see which registers it accesses and prepending to it instructions to clear all of those registers.
	www.cl.cam.ac.uk /~dmr25/superv/compthy/halting.html (535 words)

	[No title] (Site not responding. Last check: 2007-10-16)
		The machine representation encompasses any machine dependent optimization (such as register allocation) and representation needed for a target.
		The location slot is either a machine register or a stack offset.
		The modes describe whether the operand is an input to the instruction, whether it is an output of the instruction (can coexist with input mode for read-modify-write instructions), and whether it utilizes a register, memory, or a constant.
	slate.tunes.org /repos/alpha/doc/mr_notes.txt (550 words)

	The MagicBox Forums - Registering PS2 machine in Japan? (Site not responding. Last check: 2007-10-16)
		The reason I ask is because when I had a japanese dreamcast I had to connect it with a phone line and register my machine over in Japan before I was able to use my own IP provider.
		The best thing would be if the machine could be register from Norway instead of me having to phone japan to register it.
		Did you have to register the machine in japan first, or could you connect through the country you were in?
	www.the-magicbox.com /forums/showthread.php?t=201 (367 words)

	[No title] (Site not responding. Last check: 2007-10-16)
		We encode all of the registers of the general RAM into the first register of our 2-register machine by using prime encoding: if the general RAM uses
		The second register of our machine will be used for temporaries.
		is a known constant) for one decrement of the first, until the first register is zero, then entering another loop that copies the result from the second back into the first register.
	www.cs.unm.edu /~moret/computation/4/13.html (305 words)

	Emergent Technologies Inc. -- LMI K-Machine
		Since the project was kept relatively secret during its development, very few people know the details of its architecture.
		Analysis of the LMI LAMBDA showed that most functions have one or two arguments and one or two local parameters.
		O1 <- A3 ; load open register 1 with contents of ; active register 3 (b1) O2 <- CALL BAR, O2 <- A4 ; call bar, returning value to slot 2 in FOO's ; frame.
	fare.tunes.org /tmp/emergent/kmachine.htm (5981 words)

	Computation Theory
		Specifying a register machine computation by integer codes (p, d).
		Simulation of a 2-register machine by 2-state and 2-symbol Turing machines.
		Representing a register machine program by its Godel number.
	www.cl.cam.ac.uk /DeptInfo/CST98/node48.html (177 words)

Try your search on: Qwika (all wikis)