Computing sets from all infinite subsets von Greenberg, Noam, Harrison-Trainor, Matthew, Patey, Ludovic, Turetsky, Dan

Volltext

Finding bases of uncountable free abelian groups is usually difficult von GREENBERG, NOAM, TURETSKY, DAN, WESTRICK, LINDA BROWN

Volltext

STRONG JUMP-TRACEABILITY von GREENBERG, NOAM, TURETSKY, DAN

Volltext

ITERATED PRIORITY ARGUMENTS IN DESCRIPTIVE SET THEORY von DAY, ADAM, GREENBERG, NOAM, HARRISON-TRAINOR, MATTHEW, TURETSKY, DAN

Volltext

STRUCTURAL HIGHNESS NOTIONS von CALVERT, WESLEY, FRANKLIN, JOHANNA N. Y., TURETSKY, DAN

Volltext

SCOTT COMPLEXITY OF COUNTABLE STRUCTURES von ALVIR, RACHAEL, GREENBERG, NOAM, HARRISON-TRAINOR, MATTHEW, TURETSKY, DAN

Volltext

Non-density in punctual computability von Greenberg, Noam, Harrison-Trainor, Matthew, Melnikov, Alexander, Turetsky, Dan

Volltext

Martin–Löf reducibility and cost functions von Greenberg, Noam, Miller, Joseph S., Nies, André, Turetsky, Dan

Volltext

RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS von DOWNEY, ROD, GREENBERG, NOAM, HARRISON-TRAINOR, MATTHEW, PATEY, LUDOVIC, TURETSKY, DAN

Volltext

Taking the path computably traveled von Franklin, Johanna N Y, Turetsky, Dan

Volltext

Coherent randomness tests and computing the $K$-trivial sets von Bienvenu, Laurent, Greenberg, Noam, Kučera, Antonín, Nies, André, Turetsky, Dan

Volltext

The Rado path decomposition theorem von Cholak, Peter A., Igusa, Gregory, Patey, Ludovic, Soskova, Mariya I., Turetsky, Dan

Volltext

The finite intersection principle and genericity von DIAMONDSTONE, DAVID, DOWNEY, ROD, GREENBERG, NOAM, TURETSKY, DAN

Volltext

Coding in the automorphism group of a computably categorical structure von Turetsky, Dan

Volltext bestellen

Partial functions and domination von Chong, C. T., Hoi, Gordon, Stephan, Frank, Turetsky, Daniel

Volltext

COMPUTING K-TRIVIAL SETS BY INCOMPLETE RANDOM SETS von BIENVENU, LAURENT, DAY, ADAM R., GREENBERG, NOAM, KUČERA, ANTONÍN, MILLER, JOSEPH S., NIES, ANDRÉ, TURETSKY, DAN

Volltext

CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS von BIENVENU, LAURENT, DOWNEY, ROD, GREENBERG, NOAM, NIES, ANDRÉ, TURETSKY, DAN

Volltext

Joining non-low C.E. sets with diagonally non-computable functions von Bienvenu, L., Greenberg, N., Kucera, A., Miller, J. S., Nies, A., Turetsky, D.

Volltext

Coding in the automorphism group of a computably categorical structure von Turetsky, Dan

Volltext

An Effective Classification of Borel Wadge Classes von Day, Adam, Greenberg, Noam, Harrison-Trainor, Matthew, Turetsky, Dan

Volltext bestellen