Now showing items 1-10 of 308
Comparing various concepts of function prediction. Part 2.
(Latvia State University, 1975)
Prediction: f(m+1) is guessed from given f(0), ..., f(m). Program synthesis: a program computing f is guessed from given f(0), ..., f(m). The hypotheses are required to be correct for all sufficiently large m, or with some ...
One more geodesic graph
In this note, written in Latvian, a way to build geodesic graphs, graphs with unique shortest path between every two vertices, is considered. Geodesic graphs are trees, odd cycles, and nontrivial example, the graph of ...
Some reflections on the education of computer scientists
This article in Latvian contains some reflections on educational problems what concerns computer science.