{"version":"1.0","type":"link","title":"Decision problem - Newikis","description":"In computability theory and computational complexity theory, a decision problem is a computational problem that can be posed as a yes–no question on a set of input values. An example of a decision problem is deciding whether a given natural number is prime. Another example is the problem, \"given…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/0/06/Decision_Problem.svg/1280px-Decision_Problem.svg.png","thumbnail_width":1280,"thumbnail_height":1596}