Bloch’s Constant is Computable
|
|
|
|
|
|
|
|
نویسنده
|
Rettinger Robert
|
|
منبع
|
journal of universal computer science - 2008 - دوره : 14 - شماره : 6 - صفحه:896 -907
|
|
چکیده
|
Abstract: we prove the computability of bloch’s constant by presenting the first algorithm approximating the constant up to arbitrary precision.
|
|
کلیدواژه
|
computability ,algorithm ,Bloch’s constant
|
|
آدرس
|
Fern Universitat Hagen, Germany
|
|
|
|
|
|
|
|
|
|