in Theory of Computation edited by
281 views
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!},$
in Theory of Computation edited by
281 views

1 comment

Here only multiplier can do the job

right?

for $n!$ need some multiplier
0
0

Please log in or register to answer this question.

Related questions