bluemsi/2nd
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Wiki cleanup: error-doc removal, dedup merge, link normalization

Browse Source 
10_Wiki/Topics 대규모 정리:
- 오류 캡처/미완성 stub 문서 227개 제거
- 교차폴더 중복 43클러스터 병합 (63파일 → redirect)
- 링크명 정규화: 깨진 링크 수정·redirect 직결·개념 매핑 ~2,400건
- 카테고리 MOC 6개 신규 생성
- Graph 섹션 미해결 related-keyword 링크 10,058건 제거

Co-Authored-By: Claude Opus 4.7 (1M context) <noreply@anthropic.com>
This commit is contained in:
Antigravity Agent
2026-05-20 23:52:15 +09:00
parent 2a4a5046b6
commit f8b21af4be
2874 changed files with 15296 additions and 27684 deletions
Download Patch File Download Diff File Expand all files Collapse all files
10_Wiki/Topics/Computer_Science_and_Theory/Turing-Machine Foundations.md
+1 -4
View File
@@ -159,10 +159,7 @@ def UTM(encoding):
**기본값**: Standard 1-tape deterministic TM as reference; multi-tape for clarity.
## 🔗 Graph
- 부모: [[Theory-of-Computation]] · [[Formal-Languages]]
- 변형: [[Multi-Tape-TM]] · [[Non-Deterministic-TM]] · [[Lambda-Calculus]] · [[Mu-Recursive-Functions]]
- 응용: [[Halting-Problem]] · [[Complexity-Classes]] · [[Rices-Theorem]] · [[Computability]]
- Adjacent: [[Church-Turing-Thesis]] · [[Universal-Turing-Machine]] · [[P-vs-NP]]
- Adjacent: [[Universal-Turing-Machine]]
## 🤖 LLM 활용
**언제**: Computability question (is X decidable?). Complexity bounds 의 reason. Programming language design (Turing-completeness check). Cryptographic foundations.