Now showing items 21-26 of 26

    • Prediction of the next value of a function 

      Podnieks, Karlis (1981)
      The following model of inductive inference is considered. Arbitrary set tau = {tau_1, tau_2, ..., tau_n} of n total functions N->N is fixed. A "black box" outputs the values f(0), f(1), ..., f(m), ... of some function f ...
    • The double-incompleteness theorem 

      Podnieks, Karlis (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 

      Podnieks, Karlis (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 ...
    • MDA: correctness of model transformations. Which models are schemas? 

      Podnieks, Karlis (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 ...
    • An Exhaustive Search Algorithm for Finding Hamiltonian Cycles 

      Zeps, Dainis (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 ...
    • Ornamental sign language in the first order tracery belts 

      Tenisons, Modris; Zeps, Dainis (Prespacetime Journal, 2010)
      We consider an ornamental sign language of first order where principles of sieve displacement, of asymmetric building blocks as a base of ornament symmetry, color exchangeability and side equivalence principles work. Generic ...