Joined
Last Seen
0 Reputation Points
Unknown Quality Score
No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
0 Endorsements
Ranked #107.40K
|
Hi I'm am trying to prove that a partial function is only computable by a Unlimited Register Machine iff it is computable by a standard TM. How should approach this proof. Does it have anything to do with reductions? Thanks in advance 
|