1. 단어 completeness는, ¶

1.1. 완전성 ¶

논리학,logic에서 완전성.
비교: 건전성soundness과는 다른 것. 차이 tbw.
{
completeness vs soundness 참고:
https://thinkpro.tistory.com/163
}
from

완전성

완전성정리,completeness_theorem

튜링_완전성,Turing_completeness =튜링_완전성,Turing_completeness =,Turing_completeness . 튜링_완전성 Turing_completeness
{
REL:
Alan_Turing http://en.citizendium.org/wiki/Alan_Turing https://en.wikipedia.org/wiki/Alan_Turing
튜링_기계,Turing_machine

UTM
범용_튜링_기계,universal_Turing_machine? universal_Turing_machine =,universal_Turing_machine =,universal_Turing_machine . universal_Turing_machine |=,UTM UTM
{

universal_Turing_machine ?

UTM ?

https://en.wikipedia.org/wiki/Turing_machine#Universal_Turing_machines

https://simple.wikipedia.org/wiki/Turing_machine
https://en.wikipedia.org/wiki/Universal_Turing_machine
}

deterministic_Turing_machine |=,DTM DTM
{
deterministic Turing machine
https://en.wikipedia.org/wiki/Deterministic_Turing_machine : redir.

"deterministic Turing machine"

deterministic Turing machine
}

nondeterministic_Turing_machine //OR// non-deterministic_Turing_machine |=,NTM NTM ... |=,NDTM NDTM ?
{
nondeterministic Turing machine
non-deterministic Turing machine

https://simple.wikipedia.org/wiki/Non-deterministic_turing_machine
https://en.wikipedia.org/wiki/Nondeterministic_Turing_machine
}

alternating_Turing_machine alternating_Turing_machine |=,ATM ATM
// TM의 sub(variant).
{
alternating Turing machine
alternating_Turing_machine

alternating_Turing_machine ?

https://ko.wikipedia.org/wiki/교대_튜링_기계
https://en.wikipedia.org/wiki/Alternating_Turing_machine
}

probabilistic_Turing_machine =,probabilistic_Turing_machine =,probabilistic_Turing_machine . probabilistic_Turing_machine |=,PTM PTM
// TM의 sub(variant).
{
probabilistic Turing machine

probabilistic_Turing_machine ? jjjjj

https://en.wikipedia.org/wiki/Probabilistic_Turing_machine
}

QTM
quantum_Turing_machine
{
quantum Turing machine

quantum_Turing_machine = https://en.wiktionary.org/wiki/quantum_Turing_machine x 2023-12-11

양자_튜링_기계 = https://ko.wikipedia.org/wiki/양자_튜링_기계

Quantum_Turing_machine = https://en.wikipedia.org/wiki/Quantum_Turing_machine

{2023-11-07 첫 문단만 인용: "A quantum Turing machine (QTM)
or universal quantum computer // universal_quantum_computer
is an 추상기계,abstract_machine
used to model the effects of a 양자컴퓨터,quantum_computer.
It provides a simple model that captures all of the power of quantum_computation—that is, // 양자계산?

quantum_computation

Quantum_computation
any 양자알고리듬,quantum_algorithm // quantum_algorithm =,quantum_algorithm . quantum_algorithm

quantum_algorithm ? \\

Quantum_algorithm = https://en.wikipedia.org/wiki/Quantum_algorithm
can be expressed formally as a particular quantum Turing machine.
However, the computationally equivalent // n. computational_equivalence ?

computational_equivalence ? "computational equivalence"

computational equivalence \ Up: 동치,equivalence
quantum_circuit is a more common model."} // 양자회로,quantum_circuit =양자회로,quantum_circuit =,quantum_circuit 양자회로 quantum_circuit { https://en.wikipedia.org/wiki/Quantum_circuit

양자회로

quantum_circuit }

"quantum Turing machine"

quantum Turing machine

quantum Turing machine
} // quantum Turing machine

Turing_equivalence { Turing equivalence ...

Turing equivalence Turing+equivalence "Turing equivalence" } // Turing equivalence

Church-Turing_thesis =,Church-Turing_thesis =,Church-Turing_thesis . Church-Turing_thesis |=,CTT CTT
{
처치-튜링 xx

Church-Turing thesis

AKA
computability thesis
// computability_thesis =,computability_thesis . 계산가능성,computability 씨시스,thesis? =,thesis { thesis 씨시스 시시스 ... 번역이 까다롭다. 라기보단 번역어를 고르기 까다롭다. 논제 논증 논문 ...

thesis