The number of certain integral polynomials and nonrecursive sets of integers, Part 2

DOI10.1090/S0002-9947-04-03632-3zbMath1061.03046OpenAlexW1484420730MaRDI QIDQ4830356

Harvey M. Friedman

Publication date: 9 December 2004

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9947-04-03632-3

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Polynomials in number theory (11C08) Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17) Recursive functions and relations, subrecursive hierarchies (03D20) Applications of computability and recursion theory (03D80)

Related Items (1)

Embedding of provably unsolvable problems into stream ciphers;Встраивание доказуемо неразрешимых задач в шифры гаммирования

Cites Work

• Classical recursion theory. The theory of functions and sets of natural numbers
• An unsolvable problem in number theory
• The number of certain integral polynomials and nonrecursive sets of integers, Part 1

This page was built for publication: The number of certain integral polynomials and nonrecursive sets of integers, Part 2