Sciweavers

AML
2008
66views more  AML 2008»
13 years 5 months ago
Register computations on ordinals
We generalize ordinary register machines on natural numbers to machines whose registers contain arbitrary ordinals. Ordinal register machines are able to compute a recursive bounde...
Peter Koepke, Ryan Siders
VEE
2005
ACM
143views Virtualization» more  VEE 2005»
13 years 10 months ago
Virtual machine showdown: stack versus registers
Virtual machines (VMs) are commonly used to distribute programs in an architecture-neutral format, which can easily be interpreted or compiled. A long-running question in the desi...
Yunhe Shi, David Gregg, Andrew Beatty, M. Anton Er...
CIE
2007
Springer
13 years 11 months ago
The Complexity of Quickly ORM-Decidable Sets
Abstract. The Ordinal Register Machine (ORM) is one of several different machine models for infinitary computability. We classify, by complexity, the sets that can be decided quic...
Joel David Hamkins, David Linetsky, Russell G. Mil...