RE (計算複雑性理論)
1. RE (complexity)In computability theory and computational complexity theory, RE is the class of decision problems for which a 'yes' answer can be verified by a Turing machine in a finite amount of time. Informally, it means that if the answer is 'yes', then there is some procedure which takes finite time to determine this. On the other hand, if the answer is 'no', the machine might never halt.
Read “RE (complexity)” on English Wikipedia
Read “RE (計算複雑性理論)” on Japanese Wikipedia
Read “RE (complexity)” on DBpedia
Read “RE (complexity)” on English Wikipedia
Read “RE (計算複雑性理論)” on Japanese Wikipedia
Read “RE (complexity)” on DBpedia
Discussions
Log in to talk about this word.