Talk:Counter-machine model

Compare each model with the Counter machine:Reference model, and use the RefLib to show examples and comparing.

Talk:Counter-machine model

Next work

Latest comment: 5 years ago1 comment1 person in discussion

Compare each model with the Counter machine:Reference model, and use the RefLib to show examples and comparing.

Complementar sugestion

At the 14:08, 24 October 2006 version of the article, there are a "The models in more detail" section and the 10 models.

Reading (over view) each model, we can see a "soon introduction" and "Details" parts. I think the "Details part" can be split in a "near standard" (and perhaps explicit) parts:

  • Main diferencial characteristics: with the reference model (and/or predecessors).
  • Main motivations.
  • Typical instruction set: list of labels from RefLib. If necessary, a "translation table"... "John, in your original article, used J for RefLib's JZ, MULT for MUL, ... "
  • Notes: other notes, comparations, etc.

It may be to facilitate readers.

-- Krauss 26 octuber 2006

Fixing the description of Melzak's model

The description of Melzak's model used to contain the following sentence:

The phrases indefinitely large number of locations and finite number of counters here are important. This model is different than the Minsky model that allows for a finite number of locations with unbounded (effectively infinite) capacity for "markers".

I deleted it as both observations are false. There are no fundamental differences between this and a standard register machine, the author of that sentence just misunderstood what the quote actually said. Melzak's world has a potentially infinite number of locations, but this is just for the programmer's convenience. Each program in Melzak's world is a finite series of instructions, and therefore each program will actually use only a finite number of registers, just like a standard register machine. We just get to choose their names. And the "finite number of counters" is also just a misunderstanding. The "finite" in the quoted text is talking about specific configurations of the machine. Again, this is exactly the same as with a standard register machine: each register can store an arbitrarily large number but at any given moment of any calculation that number is finite.

Misof (talk) 21:20, 16 April 2021 (UTC)Reply

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.