teorie vyčíslitelnosti
| Field | Ind | Field content |
| leader | -----nam-a22------i-4500 | |
| 1 | ph678150 | |
| 3 | CZ PrNK | |
| 5 | 20160615101400.6 | |
| 8 | 120111|n|anznnbabn n a|a | |
| 40 | ## | $a ABA001 $b cze $d ABA001 |
| 72 | #7 | $a 510 $x Obecné úvahy o matematice $2 Konspekt $9 13 |
| 80 | $a 510.57 $2 MRF_2003 | |
| 150 | $a teorie vyčíslitelnosti $7 ph678150 | |
| 450 | $a teorie rekurze $0 o | |
| 450 | $a vyčíslitelnost (algoritmy) $0 o | |
| 450 | $a rekurze (algoritmy) $0 o | |
| 550 | $w g $a algoritmy $7 ph114026 | |
| 750 | $a computability theory $2 eczenas | |
| 906 | $a za20120111 $b miry | |
| 906 | $a wu20120209 $b miry | |
| 998 | $a 000678150 | |
| 1001 | $p h678150 |