4 citations · 11 across the 15 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.LO2012★ 1 cited
Blind graph rewriting systems
Anton Salikhmetov
We consider a simple (probably, the simplest) structure for random access memory. This structure can be used to construct a universal system with nearly void processor, namely, we…
cs.LO2012
A recursive normalizing one-step reduction strategy for the distributive lambda calculus
Anton Salikhmetov
We positively answer the question A.1.6 in J. Klop's "Ustica Notes": "Is there a recursive normalizing one-step reduction strategy for micro -calculus?" Micro -calculus refer…