Polynomial clone reducibility
From MaRDI portal
Publication:2436621
DOI10.1007/s00153-013-0351-xzbMath1303.03075MaRDI QIDQ2436621
Publication date: 25 February 2014
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10125/25920
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
03D30: Other degrees and reducibilities in computability and recursion theory
03D32: Algorithmic randomness and dimension
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison of linear reducibility with other reducibilities of tabular type
- Reducibility by Zhegalkin-linear tables
- Classical recursion theory. The theory of functions and sets of natural numbers
- Algorithmic Randomness and Complexity
- The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
- Some Notions of Reducibility and Productiveness
- Semirecursive Sets and Positive Reducibility
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)