出典:Wiktionary
出典:『Wiktionary』 (2026/01/17 02:06 UTC 版)
出典:Wikipedia
出典:『Wikipedia』 (2011/05/04 17:07 UTC 版)
In complexity theory and computability theory, an oracle machine is an abstract machine used to study decision problems. It can be visualized as a Turing machine with a black box, called an oracle, which is able to decide certain decision problems in a single operation. The problem can be of any complexity class. Even undecidable problems, like the halting problem, can be used.
| ・oracle machine | |
| ・munge | |
| ・Mart | |
| ・samwist | |
| ・wedewe | |
| ・Kvalaberg | |
| ・Nowhere Boy | |
| ・adnatans | |
| ・Thym1 | |
| ・Barack Obama |