429 search results - page 58 / 86 » Turing computations on ordinals |
84
Voted
PODC
2010
ACM
14 years 10 months ago
2010
ACM
We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...
100
click to vote
CJ
2006
14 years 9 months ago
2006
Mathematics is facing a dilemma at its heart: the nature of mathematical proof. We have known since Church and Turing independently showed that mathematical provability was undeci...
JUCS
2008
14 years 9 months ago
2008
: Given a probability measure and a positive integer n. How to choose n knots and n weights such that the corresponding quadrature rule has the minimum worst-case error when appli...
NC
2008
14 years 9 months ago
2008
A highly desired part of the synthetic biology toolbox is an embedded chemical microcontroller, capable of autonomously following a logic program specified by a set of instructions...
82
Voted
CCA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...