The Gateway to Computer Science Excellence
0 votes
6 views

Let $\Gamma = \{0, 1, \sqcup\}$ be the tape alphabet for all TMs in this problem. Define the busy beaver function $BB: N \rightarrow N$ as follows. For each value of $k$, consider all $k-$state TMs that halt when started with a blank tape. Let $BB(k)$ be the maximum number of $1s$ that remain on the tape among all of these machines. Show that $BB$ is not a computable function.

in Theory of Computation by Veteran (60.8k points) | 6 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,834 questions
57,852 answers
199,512 comments
108,375 users