Sciweavers

2333 search results - page 28 / 467
» Recursive Computational Depth
Sort
View
96
Voted
ISTCS
1993
Springer
15 years 4 months ago
Deterministic Approximate Counting of Depth-2 Circuits
Michael Luby, Boban Velickovic, Avi Wigderson
70
Voted
JSYML
2000
56views more  JSYML 2000»
15 years 6 days ago
Computability over The Partial Continuous Functionals
We show that to every recursive total continuous functional there is a representative of in the hierearchy of partial continuous functionals such that is S1 - S9 computable ov...
Dag Normann
58
Voted
TCS
2002
15 years 2 days ago
An example of a computable absolutely normal number
The first example of an absolutely normal number was given by Sierpinski in 1916, twenty years before the concept of computability was formalized. In this note we give a recursive...
Verónica Becher, Santiago Figueira