25 citations · 637 across the 113 of their papers we have counts for
5 papers · 2 filters
Autosolvability of halting problem instances for instruction sequences
J. A. Bergstra, C. A. Middelburg
We position Turing's result regarding the undecidability of the halting problem as a result about programs rather than machines. The mere requirement that a program of a certain ki…
Instruction sequence processing operators
J. A. Bergstra, C. A. Middelburg
Instruction sequence is a key concept in practice, but it has as yet not come prominently into the picture in theoretical circles. This paper concerns instruction sequences, the be…
Straight-line instruction sequence completeness for total calculation on cancellation meadows
Jan A. Bergstra, Inge Bethke
A combination of program algebra with the theory of meadows is designed leading to a theory of computation in algebraic structures which use in addition to a zero test and copying…
A process calculus with finitary comprehended terms
J. A. Bergstra, C. A. Middelburg
We introduce the notion of an ACP process algebra and the notion of a meadow enriched ACP process algebra. The former notion originates from the models of the axiom system ACP. The…
Square root meadows
Jan A. Bergstra, I. Bethke
Let Q_0 denote the rational numbers expanded to a meadow by totalizing inversion such that 0^{-1}=0. Q_0 can be expanded by a total sign function s that extracts the sign of a rati…