6 citations · 14 across the 10 of their papers we have counts for
10 papers
Availability of titles on peer-to-peer file sharing networks
Petrus H. Potgieter
File sharing, typically involving video or audio material in which copyright may persist and using peer-to-peer (P2P) networks like BitTorrent, has been reported to make up the bul…
Computable counter-examples to the Brouwer fixed-point theorem
Petrus H. Potgieter
This paper is an overview of results that show the Brouwer fixed-point theorem (BFPT) to be essentially non-constructive and non-computable. The main results, the counter-examples…
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…
Hypercomputing the Mandelbrot Set?
Petrus H. Potgieter
The Mandelbrot set is an extremely well-known mathematical object that can be described in a quite simple way but has very interesting and non-trivial properties. This paper survey…