This paper studies the problem of maximizing the number of correct results of dependent tasks computed unreliably. We consider a distributed system composed of a reliable server th...
Abstract. A real is called properly n-generic if it is n-generic but not n + 1generic. We show that every 1-generic real computes a properly 1-generic real. On the other hand, if m...
Barbara F. Csima, Rod Downey, Noam Greenberg, Deni...
For twenty years the Nuprl ("new pearl") system has been used to develop software systems and formal theories of computational mathematics. It has also been used to expl...
Stuart F. Allen, Mark Bickford, Robert L. Constabl...
Abstract. We analyze results on well-partial-orderings from the viewpoint of computability theory, and we answer a question posed by Diana Schmidt. We obtain the following results....
The Computational Plant (Cplant) project at Sandia National Laboratories is developing a large-scale, massively parallel computing resource from a cluster of commodity computing a...
Ron Brightwell, Lee Ann Fisk, David S. Greenberg, ...