Abstract
We show that over unbounded domain no algorithm can be created for the integer programming, nonlinear equations, continuous global optimization and constraint satisfaction problems.
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
