 |
| | Suchergebnis | | | | | | | | | © | |
|
| | | |||||||||||||
|
 |
Suchgeschichte |  |
| |
|
Kurzliste | |
| |
|
Detailanzeige | |
|
|
|
|
|
|
|
|
||||||||||
|
|
|||||
______________ | ||||||
|
|
|
|||
|
1 - 6 von 6 |
| ||
 |
Ihre Aktion | Suchen (Schlagwörter GND (Phrase) (XSP)) berechenbarkeit eingrenzen (Basisklassifikation (XBKL)) 31.11 |
||
| |
| |
| |
|
|
|
|
 |
1. |
Computability in analysis and physics Pour-El, Marian B.. - Berlin : Springer, 1989 |
|
| |||
|
2. |
Algorithmen und rekursive Funktionen Malcev, Anatolij I. *1909-1967*. - Braunschweig : Vieweg, 1974 |
|
| |||
|
3. |
Rekursive Funktionen und ihre Komplexität Schnorr, Claus Peter *1943-*. - Stuttgart : Teubner, 1974 |
|
| |||
|
4. |
Computability and decidability : an introduction for students of computer science Loeckx, Jacques *1931-2020*. - Berlin : Springer, 1972 |
|
| |||
|
5. |
Enumerability, decidability, computability : an introduction to the theory of recursive functions Hermes, Hans *1912-2003*. - Berlin : Springer, 1965 |
|
| |||
|
6. |
Computability & unsolvability Davis, Martin *1928-2023*. - New York [u.a.] : McGraw-Hill, 1958 |
|
| |||
| |||||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||||
|
1 - 6 von 6 |
|
|
|
1 - 6 von 6 |
|
|||||||||||||||||||||||||