Talk:Lossy channel system

asked whether there is a busy beaver function for channel systems. I tentatively propose the following. Let the length of an LCS be its alphabet size + number of channels + number of states. Let L be a single-agent LCS such that a maximal simulation of L from an initial configuration with empty channels ends with L halting, and call the sum of the sizes of the channels its output. Let M(L) be the maximal output of L (undefined if its outputs can become arbitrarily large). Then \(\Sigma_\text{LCS}(n)\) is the maximal possible value of M(L) given that L has length at most n.

I don't know if this is googological. -- vel! 19:12, September 3, 2015 (UTC)