A postscript version is available. Please check the postscript version if some symbol is not decipherable

- Let
*c*be any number. Show that the following problems are undecidable.**the input or Acceptance problem:**- ` ' ` ' ` '.
**the output or Printing problem:**- ` ' ` '.

- Show that the following problems are undecidable:
- ` '
- ` '
- ` '
- ` '
- ` '
- ` '
- ` '
- ` '
- ` ', where
*g*is any fixed computable function.

- Show that there is no total computable function
*f*(*x*,*y*) with the following property: if stops, then it does so in*f*(*x*,*y*) or fewer steps.

Fri Sep 5 15:56:53 IST 1997