Free Republic
Browse · Search
News/Activism
Topics · Post Article

To: Doctor Stochastic
Er, I was eavesdropping and just have to ask how this:

subtract memory location being pointed-at from the accumulator; if the accumulator is negative, skip the next location, else execute the next location

could be one instruction in machine code?

I can't even see this as a single instruction in interpretive language code.

490 posted on 06/21/2003 9:10:30 PM PDT by Alamo-Girl
[ Post Reply | Private Reply | To 488 | View Replies ]


To: Alamo-Girl
Easy. It depends on how much circuitry you want to devote to an instruction. This is not even as complicated as IEEE floating point arithmetic that most Intel processors have. There have even been fused multiply-add units for years.

The Perkin-Elmer (if they still exist) computers had instrucitons that did things such as (add, update index register, jump on condition) as a single instruction. The old IBM650 had the address of the next instruction to be executed in the instruction itself. (This was a drum memory machine and the relative location of instructions on the drum contributed to program speed. You didn't want to drop a revolution.)

It's only a curiosity but it is amusing that a single-instruction computer can emulate a universal Turing machine.
492 posted on 06/21/2003 9:15:50 PM PDT by Doctor Stochastic (Vegetabilisch = chaotisch is der Charakter der Modernen. - Friedrich Schlegel)
[ Post Reply | Private Reply | To 490 | View Replies ]

To: Alamo-Girl
I can't even see this as a single instruction in interpretive language code.

Universal computers have a "finite control function", that defines the nature and granularity of manipulations of the state. Depending on the type of machine, the execution of a single "instruction" (which is an abstract rather than literal construct) can have either very simple or very complex consequences to the state. The folding of a protein is an extremely complex behavior, but it can be triggered by the execution of a single "instruction" within that computational system. You are having problems with this because you are thinking of things like machine code, which is a very narrow instance of all possible control functions.

One of the mental hazards of computational theory is that most people view computers as being solely like the kinds of computers we build with silicon. They way we build computers in practicing is a consequence of history and practical engineering concerns, and doesn't even scratch the surface of the entire space of things that constitute "universal computers". This is a case where limited experience leads to conceptual prejudices that aren't justified.

508 posted on 06/22/2003 10:58:20 AM PDT by tortoise (Would you like to buy some rubber nipples?)
[ Post Reply | Private Reply | To 490 | View Replies ]

Free Republic
Browse · Search
News/Activism
Topics · Post Article


FreeRepublic, LLC, PO BOX 9771, FRESNO, CA 93794
FreeRepublic.com is powered by software copyright 2000-2008 John Robinson