Is it Computable? Is it Decidable?

From: Behrang (behrang_at_kimianet.com)
Date: 01/12/04 

Date: 12 Jan 2004 04:33:37 -0800

Hi,
Suppose all Turing Machines with n+1 states (1 halt state) ,{0,1} as
tape symbols, and 1^n (11...111) as input string for all of them.
f(n):N -> N is the maximum number of 1's on these TMs after halt. Is
f(n) Computable? Is it Decidable?
Thanx in Advance,
Behrang.