Abstract
For any nontrivial set of cardinal numbers ≦ ℵ 0 \leqq {\aleph _0} , it is shown that there is no algorithm for testing whether or not the number of positive integer solutions of a given polynomial Diophantine equation belongs to the set.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
