What does it mean for a computation to be “the same…
0 reactions
What does it mean for a computation to be “the same” across different models of computation?
We often treat different models of computation (Turing machines, RAM models, lambda calculus, circuit models, etc.) as equivalent up to polynomial factors.
In practice, though, these equivalences hide real differences in expressiveness, cost models, and feasibility.
How do computer scientists think about “sameness” of computation beyond asymptotic complexity, especially when moving between theory and real systems?
#technology
We often treat different models of computation (Turing machines, RAM models, lambda calculus, circuit models, etc.) as equivalent up to polynomial factors.
In practice, though, these equivalences hide real differences in expressiveness, cost models, and feasibility.
How do computer scientists think about “sameness” of computation beyond asymptotic complexity, especially when moving between theory and real systems?
#technology
| 4,000 mlx | |
| 7 | |
| 0 |