Are there are any properly paraconsistent computations—effective procedures that are recognizable as such, but which are not recognized by non-paraconsistent logic? First we motivate a positive answer, from arguments by Sylvan and Copeland, Routley, and Priest. Then we look at some simple formulations of dialetheic machines and their basic properties, and discuss these in relation to the halting problem.