Published in:
Transactions of the American Mathematical Society, 269 (1982) 2, Seite 513-520
Language:
English
ISSN:
0002-9947
Origination:
Footnote:
Description:
<p>This paper deals with the numerical content of Picard's Theorem. Two classically equivalent versions of this theorem are proved which are distinct from a computational point of view. The proofs are elementary, and constructive in the sense of Bishop. A Brouwerian counterexample is given to the original version of the theorem.</p>