Suchergebnisse - Other degrees and reducibilities in computability and recursion theory

Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees von Downey, Rodney G., Ng, Keng Meng, Solomon, Reed

“… Two of the central concepts for the study of degree structures in computability theory are computably enumerable degrees and minimal degrees …”
Volltext

Foundations of mathematics: logic at Harvard : essays in honor of Hugh Woodin's 60th birthday, March 27-29, 2015, Harvard University, Cambridge, MA von Caicedo, Andres Eduardo

“… and Banach spaces, recursion theory, and philosophy, each reflecting a period of Woodin's career …”
Volltext

Foundations of Mathematics von Caicedo, Andrés Eduardo, Cummings, James, Koellner, Peter, Larson, Paul B

“… and Banach spaces, recursion theory, and philosophy, each reflecting a period of Woodin's career …”
Volltext

Randomness, Computability, and Density von Downey, Rod G., Hirschfeldt, Denis R., Nies, André

“… This measure is called domination or Solovay reducibility and is defined by saying that $\alpha$ dominates $\beta$ if there are a constant c and a partial computable function …”
Volltext

Foundations of mathematics : logic at Harvard, essays in honor of W. Hugh Woodin's 60th birthday, March 27-29, 2015, Harvard University, Cambridge, MA von Caicedo, A. E., Cummings, James, Koellner, Peter, Larson, Paul B. (Paul Bradley), Conference in honor of Hugh Woodin's 60th birthday

Volltext

A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES von DOWNEY, ROD, GREENBERG, NOAM

“… The hierarchy unifies and classifies the combinatorics of a number of diverse constructions in computability theory …”
Volltext

Depth, Highness and DNR degrees von Moser, Philippe, Stephan, Frank

“… ] sets have high or DNR Turing degree and that no K-trival set is O(1)-[deep.sub.K]. Keywords: Bennett logical depth, Kolmogorov complexity, algorithmic randomness theory, computability and randomness …”
Volltext

Rogers semilattices of punctual numberings von Bazhenov, Nikolay, Mustafa, Manat, Ospichev, Sergei

“… The punctual reducibility between numberings is induced by primitive recursive functions. This approach gives rise to upper semilattices of degrees, which are called Rogers pr-semilattices …”
Volltext

Theory of computation for the real numbers and subrings of the real numbers following Blum/Shub/Smale von Saint John, Rose

“… Several issues arising in the Blum/Shub/Smale theory of computation for rings and fields are addressed …”
Volltext