| Title:
|
Memory complexity of countable functions (English) |
| Author:
|
Nekvinda, Miloslav |
| Language:
|
English |
| Journal:
|
Kybernetika |
| ISSN:
|
0023-5954 |
| Volume:
|
15 |
| Issue:
|
2 |
| Year:
|
1979 |
| Pages:
|
(88)-99 |
| . |
| Category:
|
math |
| . |
| MSC:
|
03D60 |
| MSC:
|
68C25 |
| MSC:
|
68Q25 |
| idZBL:
|
Zbl 0407.68052 |
| idMR:
|
MR0542055 |
| . |
| Date available:
|
2009-09-24T17:06:25Z |
| Last updated:
|
2012-06-05 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/124480 |
| . |
| Reference:
|
[1] J. Hartmanis P. M. Lewis II R. E. Stearns: Classifications of computations by time and memory requirements.IFIP Congress in New York, 1965. |
| Reference:
|
[2] H. Yamada: Counting by a class of growing automata.PhD Thesis, Moore School of Elect. Eng., University of Pennsylvania (1960). |
| Reference:
|
[3] H. Yamada: Real-time computation and recursive functions not real time computable.IRE Trans. on Electronic Computers, EC-11 (1960). MR 0152161 |
| Reference:
|
[4] P. C. Fischer A. R. Meyer A. L. Rosenberg: Time-restricted sequences generation.Journal of Computer and System Sciences 4, (1970) 50-73. MR 0253594 |
| Reference:
|
[5] M. Nekvinda: On the complexity of events recognizable in real time.Kybernetika 9, (1973), 1, 1-10. Zbl 0264.94039, MR 0329320 |
| Reference:
|
[6] M. Nekvinda: On the complexity of countable functions.Proceedings of Symposium and Summer School on Mathematical Foundations of Computer Science, High Tatras, Czechoslovakia, 1973. MR 0403314 |
| . |
