Talk:Register machine

message: This article is darn near unreadable and I'm a computer scientist.  No, really.  This is as verbose as the old article on Shaders, which I think has finally been cleaned up after numerous re-writes.   This is wikipedia NOT a dusty academic reference library, can you please put some more friendly explanatory text in at the start, and yes I think some diagrams would help.  110.174.169.36 (talk) 06:33, 6 December 2010 (UTC)
thread_title:  Unreadable 

message: Hello, random unknown person. Timwi may not be the most courteous, but he was basically right. I've added a little bit of discussion of the "alternate" instruction set, and a reference to one of these pieces of "standard" literature. Andrew Rodland 10:38, 31 October 2005 (UTC)
thread_title:  "Standard Literature" 

message: I added this because the model presented (as a kind of Turing-machine with a state table rather than consecutive instructions of 1967) does not agree with the Minsky (1967) model. Maybe his thinking evolved. cf Post-Turing machine. Also Wang B-machine or some other appropriate name yet to be devised [now devised]. Forgot to sign original entry. wvbaileyWvbailey 21:27, 4 September 2006 (UTC)
thread_title:  Added Minsky model from 1967 

message: I'm pretty sure that Mr. Kaphengst was called Heinz. 
Look here: 
http://www.nist.gov/msidlibrary/doc/kirsch_1963_application_automata.pdf 
It even refers exactly to the same paper. 
Kaphengst, Heinz. "An Abstract Programmed Computer." ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 5:3-4 (1959) 366-379 
Heinz Kaphengst published several papers together with Horst Reichel – they are sometimes mentioned as
H. Kaphengst, Horst Reichel, which lead to other pages referring to him as "Kaphengst, Horst". 
Sincerely, --217.236.235.98 16:27, 3 October 2006 (UTC)
replies: text: Excellent. We will refer to H. Kaphengst as Heinz then, until further evidence to the contrary. I'm a continent away from my books and sources at this time, so I can't double check. So far I have been unable to get copies of the German originals from their journals in my library at home. This sets me on a mission. (As I was researching I wrotedo down next to the reference H. R. as Horst Reichel but ... there may be errors in my reference or this reference, too.) This just makes the research more fun, actually. Thanks...wvbaileyWvbailey 18:05, 3 October 2006 (UTC)
thread_title: Forename

message: Hello, 
In the section "Elgot-Robinson (1964) and the problem of the RASP without indirect addressing" of this article, there is the following example of program for multiplication of m and n:
{ 1: CLR ( p ), 2: JZ ( m, done ), 3 outer_loop: JZ ( n, done ), 4: CPY ( m, temp ), 5: inner_loop: JZ ( m, outer_loop ), 6: DEC ( m ), 7: INC ( p ), 8: J ( inner_loop ), 9: outer_loop: DEC ( n ), 10 J ( outer_loop ), HALT }
It seems buggy since either the temp register is never initialized, or it is never read.
It depends of the meaning of "CPY ( m, temp )" that is not given.
If "CPY (x, y)" means put the content of y in x, then the program should be corrected as follow:
{ 1: CLR ( p ), 2: JZ ( m, done ), 3: CPY ( temp, m ), 4 outer_loop: JZ ( n, done ), 5: CPY ( m, temp ), 6: inner_loop: JZ ( m, outer_loop ), 7: DEC ( m ), 8: INC ( p ), 9: J ( inner_loop ), 10: outer_loop: DEC ( n ), 11: J ( outer_loop ), HALT }
Best regards, SectionFinale (talk) 16:32, 19 July 2017 (UTC)
thread_title: Possible error

message: SEE Wikipedia:Algorithms on Wikipedia.
Sorry, but the above is bogus. I am sticking with the convention in Boolos-Burgess-Jeffrey (2002) because it is a convention to be found in a published text. wvbaileyWvbailey 20:58, 13 November 2006 (UTC)
thread_title:  Style for Algorithms! 

message: At least one very famous introductory computer science textbook (Abelson and Sussman, Structure and Interpretation of Computer Programs) uses the term "register machine" to refer to a form of virtual machine whose practical implementation to evaluate lisp expressions is discussed.  I've put a note on that into the overview. --Tony Sidaway 03:00, 24 November 2007 (UTC)
thread_title: [[Virtual machine]]

message: I suggest a tidy up of the external links.
* Weisstein, Eric W., "Register machine" from MathWorld. (remove - duplicate of 3rd link)
* Igblan - Minsky Register Machines (remove - WP:CONFLICT - WP:ELNO: personal site - confusing article - doesn't add anything)
* Visual Register Machine (like a life game) (remove - Wikipedia:SPAM - does not add any useful content)—Preceding unsigned comment added by 60.234.246.33 (talk • contribs) 
:The first reason is not a reason to remove.  for the second, WP:CONFLICT only applies when the editor himself would have added the link.  I do agree, it is confusing.  The third one is indeed a duplicate of the first one, I will remove that one now.  --Dirk Beetstra T C 11:30, 13 April 2010 (UTC)
thread_title:  External Links