3
votes
Generalization of computability to continuous for loops?
First of all, despite claims by several people here, there are models of computation which support computation on topological spaces. The "countable vs. uncountable" distinction is a red ...
1
vote
Accepted
Why do we have free variables in mu-calculus?
If you define the $\mu$-calculus to not allow free variables, you would have the problem that the components of a well-formed formula are not again well-formed formulas.
Consider a well-formed ...
1
vote
Why is $\mu$ finite looping?
It is said that the intuitive meaning of μ is finite looping where as the intuitive meaning of ν is infinite looping in μ calculus
Here's a better phrasing: µ is about looping with a known bound on ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
mu-calculus × 14computability × 5
logic × 3
recursion × 3
computation-tree-logic × 3
terminology × 2
simulation × 2
model-checking × 2
linear-temporal-logic × 2
turing-machines × 1
formal-methods × 1
church-turing-thesis × 1
temporal-logic × 1
physics × 1
modal-logic × 1