16 citations · 106 across the 22 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2024
On the formalization of the notion of a concurrent algorithm
C. A. Middelburg
Previous papers give accounts of quests for satisfactory formalizations of the classical informal notion of an algorithm and the contemporary informal notion of an interactive algo…
cs.CC2014★ 1 cited
Instruction sequence size complexity of parity
J. A. Bergstra, C. A. Middelburg
Each Boolean function can be computed by a single-pass instruction sequence that contains only instructions to set and get the content of Boolean registers, forward jump instructio…