형용사
Able to be expressed in a language or by a set of operations that is a proper subset of the expressiveness of a Turing machine.
용법- not-comparable
- 예문
-
더 많은 예문 (1)
We also prove computability of F\o lner sets for a group that is extension of an amenable group with solvable word problem by a finitely generated group with computable F\o lner sets with subrecursive distortion function.