We study the computable content of nuclearity for C*-algebras. We show that nuclearity effectivizes automatically: a presentation of a C*-algebra is effectively nuclear, in the sense that the completely positive approximations witnessing nuclearity can be computed uniformly from the data they approximate, if and only if it is a computable presentation of a nuclear C*-algebra, and likewise for the effectivization of the Choi--Effros form of nuclearity. The main tool is an effective version of the Arveson extension theorem: we prove that the n-th matrix numerical range of a tuple from a computable presentation is computably compact, uniformly in all of its data, and deduce an algorithm which converts an approximately attainable tuple of matrices into a computable unital completely positive map attaining it. A byproduct is that the computable states of any computable presentation of a unital C∗-algebra are weak∗-dense in its state space.
We also prove that the Cuntz algebras O_n are computably categorical and obtain an effective form of Kirchberg--Phillips absorption. By contrast with the conditions above, we do not know whether every computable presentation of a nuclear C*-algebra admits a computable embedding into O_2 with a computable conditional expectation; we answer this affirmatively for commutative C*-algebras, for AF algebras, and, by a dynamical argument using invariant states, for the group C*-algebras of a class of amenable groups including all finitely presented residually finite ones. Finally, we show that the set of indices of computable presentations of nuclear C*-algebras is Pi^0_2, and that the corresponding set for c.e. presentations is Pi^0_2-hard; the latter rests on a result of independent interest, namely that amenability of computable groups is Pi^0_2-complete within the class of computable groups.