computability (computable)
The quality of being solvable or decidable by an algorithm or computational process; a problem is computable if there exists a finite, deterministic procedure that will solve it
As defined in Asking a Theoretical Physicist About the Physics of Consciousness | Roger Penrose | EP 244
Where it comes up · 1
Most important claims · 2 of 2Search all claims for “computability (computable)” →
- Polyomino tiling problems demonstrate non-computability: given a finite set of shapes, the question 'Can these shapes tile the infinite plane?' has a definite yes-or-no answer, but there is no algorithm that can compute it—the answer is true or false, but not algorithmically determinable.Asking a Theoretical Physicist About the Physics of Consciousness | Roger Penrose | EP 244
- There is an underlying unifying principle to Penrose's diverse intellectual pursuits—computability, representation, pattern—even though Penrose himself hesitates to articulate it; something feels 'right' intuitively before it can be fully rationalized.Asking a Theoretical Physicist About the Physics of Consciousness | Roger Penrose | EP 244