Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

108

Voted

CIE
2010
Springer

101views Applied Computing» more CIE 2010»

Undecidability in Weihrauch Degrees

15 years 2 hour ago

Undecidability in Weihrauch Degrees

Download www.iis.nsk.su

Oleg V. Kudinov, Victor L. Selivanov, Anton V. Zhu

Real-time Traffic

Applied Computing | CIE 2010 |

claim paper

Related Content

» Weihrauch Degrees Omniscience Principles and Weak Computability

» Weakly Computable Real Numbers

» Effective Choice and Boundedness Principles in Computable Analysis

» Undecidability of the structure of the Solovay degrees of ce reals

» A Useful Undecidable Theory

» Cellular Automata Decidability and Phasespace

» Degrees of Monotonicity of Spatial Transformations

» MTL with Bounded Variability Decidability and Complexity

» Computably Enumerable Sets and QuasiReducibility

Post Info
More Details (n/a)

Added	13 May 2011
Updated	13 May 2011
Type	Journal
Year	2010
Where	CIE
Authors	Oleg V. Kudinov, Victor L. Selivanov, Anton V. Zhukov

Comments (0)