Arbitrary sequence RAMs
type: Item
instance of: scholarly article
title: Arbitrary sequence RAMs
zbMATH Open document ID: 1302.68115
author: Michael Brand
published in: Information Processing Letters
publication date: 2014-12-09T00:00:00Z
full work available at URL: https://arxiv.org/abs/1310.4588
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6378653
zbMATH Keywords: arbitrary number
zbMATH Keywords: random access machine
zbMATH Keywords: arithmetic complexity
zbMATH Keywords: computational complexity
zbMATH Keywords: theory of computation
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2092899023
arXiv ID: 1310.4588
cites work: Q4091421
cites work: On the power of the shift instruction
cites work: Computing with and without Arbitrary Large Numbers
cites work: Fast exponentiation using the truncation operation
cites work: Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
cites work: Q4146722
cites work: On Faster Integer Calculations Using Non-arithmetic Primitives
cites work: Q4732103
cites work: A lower bound for integer greatest common divisor computations
cites work: Lower Bounds for Computations with the Floor Operation
cites work: Q3940846
cites work: Q4162478
cites work: Q4197343
cites work: Factoring numbers in O(log n) arithmetic steps
cites work: Division in idealized unit cost RAMs
cites work: On undecidable statements in enlarged systems of logic and the concept of truth
DOI: 10.1016/J.IPL.2014.09.010
description: scientific article