Files

T

Antigravity Agent 9148c358d0 docs(10_Wiki): 위키 전체 재구성 — Topic_* 폴더를 4개 카테고리로 통합 + 대규모 중복 제거

Topic_Agent/Topic_Blog/Topics/Topics_Biz/Topics_Meeting/Topics_Rag의 마크다운 지식 문서를
Topic_General/Topic_Programming/Topic_Graphic/Topic_Business 4개 카테고리로 재분류.

- 중복 제거: frontmatter의 status:duplicate/merged + duplicate_of/redirect_to 필드로
  자기 자신을 중복으로 선언한 리다이렉트 stub 1032개 제거, 완전 동일 내용 파일 472개 제거,
  동일 파일명·다른 내용 충돌 시 더 큰(완전한) 버전만 유지(162개 제거) — 총 1639개 중복 제거.
- 분류: 폴더 단위로 명확한 항목(AI_and_ML/Coding/Architecture 등 → Programming,
  Comfyui/Visual_Effects → Graphic, Topics_Biz/Topics_Meeting/사업 등 → Business,
  Poetic_Blog_Writing/창의성/Game_Design 등 → General)은 폴더 우선순위로,
  나머지 혼재 폴더(Topic_Agent/Topic_Blog/Topics 루트/Thinking & Reasoning/Other/UI_UX_Assets)는
  title/tags 키워드 스코어링으로 파일 단위 분류(불명확한 경우 General로 폴백).
  원본 폴더명은 "From_*" 서브폴더로 보존해 추적 가능성 유지.
- 최종 배치: Programming 2784 / General 1608 / Graphic 285 / Business 249 = 4926개 문서.
- 에이전트 운영 상태(.astra/.agent/.obsidian/sessions/memory/_company/docs/lessons/_shared/src)는
  지식 콘텐츠가 아니므로 재분류 대상에서 제외하고 원위치 유지.
- Topics/Topic_email(상위 보호 폴더 Topic_email과 파일명 100% 중복) 삭제 — 보호 폴더 자체는 미변경.
- 완전히 비게 된 Topic_Agent/Topic_Blog/Topics_Biz/Topics_Rag 폴더 제거.

2026-07-05 00:33:48 +09:00

3.8 KiB

Raw Blame History

id, title, category, status, canonical_id, aliases, duplicate_of, source_trust_level, confidence_score, verification_status, tags, raw_sources, last_reinforced, github_commit, tech_stack

title

Mental Operations Synthesized

매 한 줄

"매 think-about-thinking 의 toolkit". 매 Polya (1945 How to Solve It), Bloom's Taxonomy, Dual Process Theory (Kahneman), 매 lineage 의 synthesis — 매 generic mental moves 매 cross-domain transferable.

매 핵심

매 the operations

Decompose: split problem into sub-problems.
Abstract: drop irrelevant details, keep essence.
Generalize: extend known to wider class.
Specialize: take general → solve concrete instance.
Analogize: structurally-similar known problem.
Invert: solve the negation, the dual, the inverse.
Verify: test boundary cases, sanity checks.
Iterate: refine via cycles.

매 modern frame

System 1 (Kahneman): pattern-match, intuitive.
System 2: deliberate, sequential, costly.
매 expert 의 chunking 의 System 1 expansion.

매 응용

Algorithm design (CLRS-style).
Debugging (binary search of state space).
Strategy / business problems (MECE, issue trees).
LLM prompting (Chain-of-Thought = explicit System 2).

💻 패턴

Polya's 4-step (problem solving)

1. Understand: restate problem in own words.
2. Plan:       map to known technique (analogize).
3. Execute:    carry out plan, check each step.
4. Look back:  verify, generalize, simplify.

Decompose: tree

Problem: Build chat app
├── auth (sub: oauth flow, session, refresh)
├── transport (sub: WS, fallback to SSE)
├── persistence (sub: schema, migrations)
└── UI (sub: list, composer, attachments)

Inversion (Charlie Munger / Carl Jacobi)

Original: "How do I make this app fast?"
Inverted: "How would I make it slow?"
  → list 50 ways → avoid each

Analogy mapping

Known: Dijkstra (shortest path on graph)
New:   "find cheapest API call sequence"
Map:   nodes=states, edges=API calls, weight=cost
→ apply Dijkstra

Specialize → Generalize bootstrap

1. Solve N=1 case by hand.
2. Solve N=2.
3. Spot pattern.
4. Conjecture for N.
5. Prove by induction.

Verify: boundary tests (CS / engineering)

def median(xs): ...
assert median([5]) == 5                       # single
assert median([1, 2]) == 1.5                  # even
assert median([]) is None                     # empty
assert median([1, 1, 1]) == 1                 # duplicates

매 결정 기준

Stuck-state	Operation
Too big to grasp	Decompose
Too messy / many details	Abstract
No idea where to start	Analogize
Direct attack failing	Invert
Don't trust the answer	Verify

기본값: Polya 4-step + decompose-first. 매 invert when stuck.

🔗 Graph

부모: Problem_Solving
변형: First-Principles · MECE
Adjacent: Chain-of-Thought

🤖 LLM 활용

언제: prompt-design (CoT = these operations made explicit), self-review of complex tasks. 언제 X: routine pattern-match tasks (System 1 sufficient).

❌ 안티패턴

Always System 2: 매 exhausting + slow.
Always System 1 on hard problems: 매 systematic errors.
No verification step: 매 plausible-but-wrong.

🧪 검증 / 중복

Verified (Polya — How to Solve It; Kahneman — Thinking Fast and Slow; Bloom's Taxonomy).
신뢰도 B+.

🕓 Changelog

날짜	변경
2026-05-08	Phase 1
2026-05-10	Manual cleanup — Mental Operations FULL synthesis

3.8 KiB Raw Blame History