4 citations · 9 across the 6 of their papers we have counts for
6 papers
Products and tensor products of graphs and homomorphisms
Izak Broere, Johannes Heidema
We introduce and study, for a process P delivering edges on the Cartesian product of the vertex sets of a given set of graphs, the P-product of these graphs, thereby generalizing m…
Universality and programmability of quantum computers
Willem Fouche', Johannes Heidema, Glyn Jones +1
Manin, Feynman, and Deutsch have viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum logic circuits and quantum Turing…
Halting in quantum Turing computation
W. L. Fouché, J. Heidema, G. Jones +1
The paper considers the halting scheme for quantum Turing machines. The scheme originally proposed by Deutsch appears to be correct, but not exactly as originally intended. We disc…
Deutsch's Universal Quantum Turing Machine (Revisited)
Willem Fouché, Johannes Heidema, Glyn Jones +1
Deutsch, Feynman, and Manin viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum Turing machines has shown how these mac…
Quantum computing (Kwantumberekening)
W. L. Fouché, J. Heidema, P. H. Potgieter
There has been no lack of coverage in the past few years in scientific journals of the topic of quantum computation. Rightly so, as this is a novel idea with--so far--at least one…
Some logics of belief and disbelief
Samir Chopra, Johannes Heidema, Thomas Meyer
The introduction of explicit notions of rejection, or disbelief, into logics for knowledge representation can be justified in a number of ways. Motivations range from the need for…