Sheela
Sheela
Home
Add
Questions
Thinkers
Claims
People
Concepts
Jargon
Sources
Health
Predictions
Collections
Domain Landscape
Contribute
Review
Dedup
Topic requests
Settings
Help

← Jargon

Jargoncomputer science· 1 claim· 1 episode

Turing computability

The class of functions that can be computed by a Turing machine, defining the standard notion of what is algorithmically computable.

As defined in David Deutsch


Where it comes up · 1
  • David Deutsch1 claim

Most important claims · 1 of 1Search all claims for “Turing computability” →
  • The hypothesis that we live in an inescapable simulation is not an empirical theory and can be rejected out of hand for the same reason as supernatural claims, because it posits a barrier beyond which we cannot understand — we couldn't tell what the simulating computer is made of or what laws it obeys, making it no more testable than 'Zeus did it' or 'Odin did it.'David Deutsch