Browsing Matemātikas un informātikas institūts / Institute of Mathematics and Computer Science by Title
Now showing items 9-28 of 79
-
Comparing various concepts of function prediction. Part 1.
(Latvia State University, 1974)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 ... -
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 ... -
Comparing various types of limiting synthesis and prediction of functions
(Latvia State University, 1974) -
Computational complexity of prediction strategies
(Latvia State University, 1977)The value f(m+1) is predicted from given f(1), ..., f(m). For every enumeration T(n, x) there is a strategy that predicts the n-th function of T making no more than log2(n) errors (Barzdins-Freivalds). It is proved in the ... -
Dažas transformācijas elementārā ģeometrijā
(1935-04-25)Referāts nolasīts matēmatisko zinātņu darbinieku kongresā, 25. aprīlī 1935. gadā. Izdots Rīgā, 1936. Izdevusi Matēmatisko zinātņu darbinieku biedrība. Autors Cand. math. E. Grünbergs -
Daži pētījumi par telpas ruletēm
(1933-08-14)Darbs kvalificēts kā Kandidāta darbs, Konkursa darbs, iesniegts LŪ, Matēmatikas nodaļai 1933. g. 14. augustā. Stud. math. Emanuels Grünbergs, Matr. 14875. Motto "Patientia vincet." Disertācijā 143 lpp. Publicējam bez pilnā ... -
Daži trīssakarīgi grafi un to saimes bez Hamiltona cikliem
(2013-12-17)These manuscripts (in Latvian) contain examples of graphs without Hamiltonian cycles. See the flower snark J5 on the page 13. The date here 1.6.78. -
The double-incompleteness theorem
(Stiinca, Kishinev, 1976)Let T be a strong enough theory, and M - its metatheory, both are consistent. Then there is a closed arithmetical formula H that is undecidable in T, but one cannot prove in M neither that H is T-unprovable, nor that H is ... -
The double-incompleteness theorem
(Latvia State University, 1975)Let T be a theory, Q - a metatheory of T. Under certain conditions there exist T-undecidable sentences for which this undecidability cannot be proved in Q. For English translation and proof, see K. Podnieks What is ... -
An Exhaustive Search Algorithm for Finding Hamiltonian Cycles
(EIK,Elektronische Informationsverarbeitung und Kybernetik, Universität Trier, Akademie Verlag, 1980)The paper suggests an exhaustive search algorithm for finding Hamiltonian circuits in an undirected graph based on depth-first search and working successfully on sparse graphs. The method is based on the idea not to ... -
Fragile Correctness of Social Network Analysis
(2016-11-07)Graph techniques are widely used in social network analysis. However, there are some disputable applications where results are obtained from the graphs using paths longer than one and are not simply applicable to objects ... -
FrameNet CNL: a Knowledge Representation and Information Extraction Language
(Springer, 2014) -
Geodesic graphs
(2013-12-17)In the article, written in Russian, geodesic graphs, graphs with unique shortest path between every two vertices, are considered. Geodesic graphs are trees, odd cycles, and nontrivial example, the graph of Petersen. ... -
How to draw combinatorial maps?
(2013-01-31)In this article we consider the combinatorial map (rendered by permutations) approach to graphs on surfaces and how between both could be establish some terminological uniformity in favor of combinatorial maps in the way ... -
Inductive inference of recursive functions: complexity bounds
(Springer Verlag, 1991)This survey includes principal results on complexity of inductive inference for recursively enumerable classes of total recursive functions. Inductive inference is a process to find an algorithm from sample computations. ... -
Matemātiķim Emanuelam Grinbergam - 80
(Zvaigžņotā Debess, 1990-01)īss izcilā latviešu matemātiķa Emanuela Grinberga dzīves un darbības apraksts -
MDA: correctness of model transformations. Which models are schemas?
(IOS Press, 2005)How to determine, is a proposed model transformation correct, or not? In general, the answer may depend on the model semantics. Of course, a model transformation is “correct”, if we can extend it to a “correct” instance ... -
Modeling and Query Language for Hospitals
(Springer, 2013) -
Motives for reflections Addendum to part one
(2013-12-17)The article (in three pieces of manuscripts), written in Russian, contains some reflections on graph theory. It may be written in 1973. -
Motives for reflections. Part one
(2013-12-12)Facsimile of manuscript from the archive of Emanuels Grinbergs, University of Latvia. The article (in three pieces of manuscripts), written in Russian, contains some reflections on graph theory. It may be written in 1973.