There are two other possibilities that come to mind, though : Computer A may be a finite state machine and the task may be to recognize a context-free grammar, so Computer A would not be able to perform the task ( because it is not a universal computer ) . My guess ( without proof ) is that Computer A would not be able to build, e . g ., a pushdown automata that could recognize the context free grammar.
