Klaus Draeger
  • Member for 10 years, 8 months
  • Last seen this week
Where can I find a Turing machine evaluating arithmetic expressions?
Accepted answer
1 votes

Probably the main reason why you don't find such a machine is its complexity - most textbooks try to not overwhelm the reader with details. We can give a sketch of how to construct it, however. Note ...

View answer
Polytopes convex hull
1 votes

Assuming your polytopes are closed, I don't think this is true. Each of your polytopes $P_1,P_2,Q$ is a product of (possibly unbounded) intervals $I_i^1$, $I_i^2$, or $I_i^Q$, respectively, for $i=1,\...

View answer
representing code path as graph walks.. a provable graph walk?
1 votes

What is your notion of validity? If it means that the branches you take are consistent with the data, then your problem sounds very similar to the counterexample analysis which has to be done as a ...

View answer
Calculate sum of reciprocal rank in arbitrary large graph
Accepted answer
0 votes

If I understand the requirements correctly, the answer is no. I will restate (what I understand to be) the problem: We are dealing with graphs $(V,E,\delta)$ (undirected, though directed edges won't ...

View answer
1
2