0 votes 0 votes Using adders, subtracters, comparers, copiers or multipliers, draw block diagrams for Turing machines that compute the functions for all positive integers $n$ $f(n) = n^{n!},$ Theory of Computation peter-linz peter-linz-edition5 theory-of-computation turing-machine + – Rishi yadav asked Apr 9, 2019 • edited Apr 9, 2019 by Rishi yadav Rishi yadav 294 views answer comment Share Follow See 1 comment See all 1 1 comment reply srestha commented Apr 9, 2019 reply Follow Share Here only multiplier can do the job right? for $n!$ need some multiplier 0 votes 0 votes Please log in or register to add a comment.