발음 (5)
-
/dɪˌtɜː.mɪˈnɪs.tɪk/
발음 참고
- Received-Pronunciation
-
/dɪˌtɝ.mɪˈnɪs.tɪk/
발음 참고
- Canada
- General-American
-
/dɪˌtɜː.mɪˈnɪs.tɪk/
발음 참고
- Australia
-
/dəˌtøː.məˈnəs.tək/
발음 참고
- New-Zealand
-
dɪˈtɜːmɪnɪstɪk
발음 참고
- GB
형용사
Of, or relating to determinism.
Having at most one instruction associated with any given internal state.
용법- of a Turing machine
- 예문
-
Another class, P, is a subset of NP, and includes all decision problems that can be solved by a (deterministic) Turing machine in polynomial time.
Having exactly predictable time evolution.
용법- of a system
For a given particular input, always producing the same output through the same sequence of states.
용법- of an algorithm
- 예문
-
On the other hand, if the genetic algorithm has many advantages, their computation cost is higher as compared with deterministic algorithms.
형용사
an inevitable consequence of antecedent sufficient causes