Computability and Complexity - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

43

(FIVE YEARS 0)

H-INDEX

3

(FIVE YEARS 0)

Published By Springer International Publishing

9783319500614, 9783319500621

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Erratum to: There Are No Maximal d.c.e. wtt-degrees

Computability and Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-319-50062-1_43 ◽

2017 ◽

pp. E1-E1

Author(s):

Guohua Wu ◽

Mars M. Yamaleev

Download Full-text

Effective Bi-immunity and Randomness

Computability and Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-319-50062-1_38 ◽

2016 ◽

pp. 633-643 ◽

Author(s):

Achilles A. Beros ◽

Mushfeq Khan ◽

Bjørn Kjos-Hanssen

Download Full-text

Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions

Computability and Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-319-50062-1_40 ◽

2016 ◽

pp. 660-668 ◽

Author(s):

Stephen G. Simpson

Keyword(s):

Download Full-text

A Survey of Results on the d-c.e. and n-c.e. Degrees

Computability and Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-319-50062-1_27 ◽

2016 ◽

pp. 469-478 ◽

Author(s):

Marat M. Arslanov ◽

Iskander Sh. Kalimullin

Download Full-text

On the Reals Which Cannot Be Random

Computability and Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-319-50062-1_36 ◽

2016 ◽

pp. 611-622 ◽

Author(s):

Liang Yu ◽

Yizheng Zhu

Download Full-text

On Splits of Computably Enumerable Sets

Computability and Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-319-50062-1_31 ◽

2016 ◽

pp. 521-535

Author(s):

Peter A. Cholak

Keyword(s):

Computably Enumerable Sets ◽

Computably Enumerable

Download Full-text

Algorithmic Statistics: Forty Years Later

Computability and Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-319-50062-1_41 ◽

2016 ◽

pp. 669-737 ◽

Author(s):

Nikolay Vereshchagin ◽

Alexander Shen

Download Full-text

Permutations of the Integers Induce only the Trivial Automorphism of the Turing Degrees

Computability and Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-319-50062-1_35 ◽

2016 ◽

pp. 599-607 ◽

Author(s):

Bjørn Kjos-Hanssen

Keyword(s):

Download Full-text

Prequel to the Cornell Computer Science Department

Computability and Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-319-50062-1_3 ◽

2016 ◽

pp. 19-21

Author(s):

Anil Nerode

Keyword(s):

Computer Science ◽

Science Department ◽

Computer Science Department

Download Full-text

Lowness, Randomness, and Computable Analysis

Computability and Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-319-50062-1_42 ◽

2016 ◽

pp. 738-754 ◽

Author(s):

André Nies

Keyword(s):

Computable Analysis

Download Full-text