Jacek Waldmajer

Dr. Jacek Waldmajer

Computer Science, Opole University, Opole, Opolskie, Poland
orcid

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 June 2011 in Logica Universalis
Verified
Journal Article
Open access
PDF file
UWUrszula Wybraniec-Skardowska
Urszula Wybraniec-Skardowska
JWJacek Waldmajer
Jacek Waldmajer
In the paper, the authors discuss two kinds of consequence operations characterized axiomatically. The first one are consequence operations of the type Cn + that, in the intuitive sense, are infallible operations, always leading from accepted (true) sentences of a deductive system to accepted (true) sentences of the deductive system (see Tarski in Monatshefte für Mathematik und Physik 37:361–404, 1930, Comptes Rendus des Séances De la Société des Sciences et des Lettres de Varsovie 23:22–29, 1930; Pogorzelski and Słupecki in Stud Logic 9:163–176, 1960, Stud Logic 10:77–95, 1960). The second kind are dual consequence operations of the type Cn − that can be regarded as anti-infallible operations leading from non-accepted (rejected, false) sentences of a deductive system to non-accepted (rejected, false) sentences of the system (see Słupecki in Funkcja Łukasiewicza, 33–40, 1959; Wybraniec-Skardowska in Teoria zdań odrzuconych, 5–131, Zeszyty Naukowe Wyższej Szkoły Inżynierskiej w Opolu, Seria Matematyka 4(81):35–61, 1983, Ann Pure Appl Logic 127:243–266, 2004, in On the notion and function of rejected propositions, 179–202, 2005). The operations of the types Cn + and Cn − can be ordinary finitistic consequence operations or unit consequence operations. A deductive system can be characterized in two ways by the following triple: $$\begin{array}{ll}{\rm by\,the\,triple}:\hspace{1.4cm} (+ , -)\hspace{0,6cm} \\ {\rm or\,by\,the\,triple}:\hspace{1.0cm} (-, +)\hspace{0,6cm} .\end{array}$$ We compare axiom systems for operations of the types Cn + and Cn −, give some methodological properties of deductive systems defined by means of these operations (e.g. consistency, completeness, decidability in Łukasiewicz’s sense), as well as formulate different metatheorems concerning them.

8 July 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
SSSebastian Sakowski
Sebastian Sakowski
JWJacek Waldmajer
Jacek Waldmajer
IMIreneusz Majsterek
Ireneusz Majsterek
TPTomasz Popławski
Tomasz Popławski
The branch of informatics that deals with construction and operation of computers built of DNA, is one of the research directions which investigates issues related to the use of DNA as hardware and software. This concept assumes the use of DNA computers due to their biological origin mainly for intelligent, personalized and targeted diagnostics frequently related to therapy. Important elements of this concept are (1) the retrieval of unique DNA sequences using machine learning methods and, based on the results of this process, (2) the construction/design of smart diagnostic biochip projects. The authors of this paper propose a new concept of designing diagnostic biochips, the key elements of which are machine-learning methods and the concept of biomolecular queue automata. This approach enables the scheduling of computational tasks at the molecular level by sequential events of cutting and ligating DNA molecules. We also summarize current challenges and perspectives of biomolecular computer application and machine-learning approaches using DNA sequence data mining.

23 October 2017 in Genetics and Molecular Biology
Verified
Journal Article
Open access
PDF file
SSSebastian Sakowski
Sebastian Sakowski
TKTadeusz Krasinski
Tadeusz Krasinski
JWJacek Waldmajer
Jacek Waldmajer
JSJoanna Sarnik
Joanna Sarnik
Janusz BlasiakJanusz Blasiak
Janusz Blasiak
TPTomasz Popławski
Tomasz Popławski
The development of conventional, silicon-based computers has several limitations, including some related to the Heisenberg uncertainty principle and the von Neumann “bottleneck”. Biomolecular computers based on DNA and proteins are largely free of these disadvantages and, along with quantum computers, are reasonable alternatives to their conventional counterparts in some applications. The idea of a DNA computer proposed by Ehud Shapiro’s group at the Weizmann Institute of Science was developed using one restriction enzyme as hardware and DNA fragments (the transition molecules) as software and input/output signals. This computer represented a two-state two-symbol finite automaton that was subsequently extended by using two restriction enzymes. In this paper, we propose the idea of a multistate biomolecular computer with multiple commercially available restriction enzymes as hardware. Additionally, an algorithmic method for the construction of transition molecules in the DNA computer based on the use of multiple restriction enzymes is presented. We use this method to construct multistate, biomolecular, nondeterministic finite automata with four commercially available restriction enzymes as hardware. We also describe an experimental applicaton of this theoretical model to a biomolecular finite automaton made of four endonucleases.

1 January 2013 in Fundamenta Informaticae
Verified
Journal Article
Closed access
PDF file
TKTadeusz Krasiński
Tadeusz Krasiński
SSSebastian Sakowski
Sebastian Sakowski
JWJacek Waldmajer
Jacek Waldmajer
TPTomasz Popławski
Tomasz Popławski
In the paper we present a theoretical analysis of extension of the finite automaton built on DNA (introduced by the Shapiro team) to an arbitrary number of states and symbols. In the implementation we use a new idea of several restriction enzymes instead of one. We give arithmetical conditions for the existence of such extensions in terms of ingredients used in the implementation.

22 April 2017 in Zeitschrift für Naturforschung C
Verified
Journal Article
Closed access
PDF file
SSSebastian Sakowski
Sebastian Sakowski
TKTadeusz Krasiński
Tadeusz Krasiński
JSJoanna Sarnik
Joanna Sarnik
Janusz BlasiakJanusz Blasiak
Janusz Blasiak
JWJacek Waldmajer
Jacek Waldmajer
TPTomasz Popławski
Tomasz Popławski
Great advances in biotechnology have allowed the construction of a computer from DNA. One of the proposed solutions is a biomolecular finite automaton, a simple two-state DNA computer without memory, which was presented by Ehud Shapiro’s group at the Weizmann Institute of Science. The main problem with this computer, in which biomolecules carry out logical operations, is its complexity – increasing the number of states of biomolecular automata. In this study, we constructed (in laboratory conditions) a six-state DNA computer that uses two endonucleases (e.g. AcuI and BbvI) and a ligase. We have presented a detailed experimental verification of its feasibility. We described the effect of the number of states, the length of input data, and the nondeterminism on the computing process. We also tested different automata (with three, four, and six states) running on various accepted input words of different lengths such as ab, aab, aaab, ababa, and of an unaccepted word ba. Moreover, this article presents the reaction optimization and the methods of eliminating certain biochemical problems occurring in the implementation of a biomolecular DNA automaton based on two endonucleases.

1 September 2019 in Theoretical Computer Science
Verified
Journal Article
Closed access
JWJacek Waldmajer
Jacek Waldmajer
ZBZbigniew Bonikowski
Zbigniew Bonikowski
SSSebastian Sakowski
Sebastian Sakowski