%
% Assignment 4d for CS3530 Computational Theory:
% Turing Machines
% Fall 2024
%
% Problems taken from Sipser
%

\documentclass{article}

\usepackage[margin=1in]{geometry}
\usepackage{amsfonts}
\usepackage{amsmath}
\usepackage[english]{babel}
\usepackage[utf8]{inputenc}
\usepackage{ae,aecompl}
\usepackage{enumerate}
\usepackage{multicol}

% skip for paragraphs, don't indent
\parskip 6pt plus 1pt
\parindent=0pt
\raggedbottom

% a list environment with no bullets or numbers
\newenvironment{indentlist}{\begin{list}{}{\addtolength{\itemsep}{0.5\baselineskip}}}{\end{list}}

\begin{document}
\begin{center}
\textbf{\Large CS 3530: Assignment 4d} \\[2mm]
Fall 2024
\end{center}

\raggedright

\section*{Problem 4.18 (20 points)}

\subsection*{Problem}

Let $A$ and $B$ be two disjoint languages.  Say that language $C$ \textbf{separates} $A$ and $B$
if $A \subseteq C$ and $B \subseteq \overline{C}$.  Show that any two disjoint co-Turing-recognizable languages
are separable by some decidable language.

Notes: A and B are disjoint, means $A \cap B = \emptyset$. 

\subsection*{Solution}


\end{document}
