Which of the following problems about Turing machines are solvable, and which are undecidable? Explain your answers carefully. a. To determine, given a Turing machine M, a state q, and a string w, whether M ever reaches state q when started with input w from its initial state. b. To determine, given a Turing machine M and a symbol a, whether M ever writes the symbol a when started with the empty tape.

Is it ok to use a does red wine clean the inside of a computer true or false

Are special characters that allow you to search for multiple words at the same time.

Assume that minutes is an int variable whose value is 0 or positive. write an expression whose value is "undercooked" or "soft-boiled" or "medium-boiled" or "hard-boiled" or "overcooked" based on the value of minutes. in particular: if the value of minutes is less than 2 the expression's value is "undercooked"; 2-4 would be a "soft-boiled", 5-7 would be "medium-boiled", 8-11 would be "hard-boiled" and 12 or more would be a "overcooked".