57 citations · 59 across the 12 of their papers we have counts for
5 papers · 1 filter
Arbitrary Sequence RAMs
Michael Brand
It is known that in some cases a Random Access Machine (RAM) benefits from having an additional input that is an arbitrary number, satisfying only the criterion of being sufficient…
On the density of nice Friedmans
Michael Brand
A Friedman number is a positive integer which is the result of an expression combining all of its own digits by use of the four basic operations, exponentiation and digit concatena…
The RAM equivalent of P vs. RP
Michael Brand
One of the fundamental open questions in computational complexity is whether the class of problems solvable by use of stochasticity under the Random Polynomial time (RP) model is l…
Computing with and without arbitrary large numbers
Michael Brand
In the study of random access machines (RAMs) it has been shown that the availability of an extra input integer, having no special properties other than being sufficiently large, i…
Lower bounds on the Münchhausen problem
Michael Brand
"The Baron's omni-sequence", B(n), first defined by Khovanova and Lewis (2011), is a sequence that gives for each n the minimum number of weighings on balance scales that can verif…