cs-computability
- Propósito: Analyze computability questions — decidability, reductions, recognizability, and undecidability proofs — with formal problem transformations.
- Contenido sugerido: reduction patterns, proof structure, and canonical examples.
- Estado: defined as a practical CS specialization.