Register machine

Known as: Minsky machine, Abacus machine, Minsky register machine 
In mathematical logic and theoretical computer science a register machine is a generic class of abstract machines used in a manner similar to a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1969-2017
051019692017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
This paper introduces a class of register machines whose registers can be updated by polynomial functions when a transition is… (More)
  • figure 2
  • figure 3
  • table 1
Is this relevant?
2010
2010
Infinite time register machines (ITRMs) are register machines which act on natural numbers and which are allowed to run for… (More)
Is this relevant?
2006
2006
Infinite time register machines (ITRMs) are register machines which act on natural numbers and which may run for arbitrarily many… (More)
Is this relevant?
2006
2006
Register machine programs provide explicit proofs of the sn -Theorem, Kleene’s Second Recursion Theorem, and Smullyan’s Double… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
In this paper, we strengthen two recent undecidability results of [9,10] about weighted timed automata, an extension of timed… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Virtual machines (VMs) enable the distribution of programs in an architecture-neutral format, which can easily be interpreted or… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2003
2003
Virtual machines (VMs) are a popular target for language implementers. Conventional wisdom tells us that virtual stack… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2001
2001
We study extensions of the process algebra axiom system <b>ACP</b> with two recursive operations: the <i>binary Kleene star</i… (More)
  • table I
  • table II
  • table III
  • table IV
  • table V
Is this relevant?
1996
1996
Several small universal register machines are constructed. The number of instructions vary from 32 to 14, depending on the chosen… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The majority of commercial computers today are register machines of von Neumann type. We have developed a method to evolve Turing… (More)
Is this relevant?