Counter Machines Research Articles

MOST SIMPLE EXTENSIONS OF ARE UNDECIDABLE

AbstractAll known structural extensions of the substructural logic $\textbf{FL}_{\textbf{e}}$ , the Full Lambek calculus with exchange/commutativity (corresponding to subvarieties of commutative residuated lattices axiomatized by $\{\vee , \cdot , 1\}$ -equations), have decidable theoremhood; in particular all the ones defined by knotted axioms enjoy strong decidability properties (such as the finite embeddability property). We provide infinitely many such extensions that have undecidable theoremhood, by encoding machines with undecidable halting problem. An even bigger class of extensions is shown to have undecidable deducibility problem (the corresponding varieties of residuated lattices have undecidable word problem); actually with very few exceptions, such as the knotted axioms and the other prespinal axioms, we prove that undecidability is ubiquitous. Known undecidability results for non-commutative extensions use an encoding that fails in the presence of commutativity, so and-branching counter machines are employed. Even these machines provide encodings that fail to capture proper extensions of commutativity, therefore we introduce a new variant that works on an exponential scale. The correctness of the encoding is established by employing the theory of residuated frames.

Undecidability of the speed positiveness problem in reversible and complete Turing machines

In 2014, Jeandel proved that two dynamical properties regarding Turing machines can be computable with any desired error ϵ>0, the Turing machine Maximum Speed and Topological Entropy. Both problems were proved in parallel, using equivalent properties. Those results were unexpected, as most (if not all) dynamical properties are undecidable. Nevertheless, Topological Entropy positiveness for reversible and complete Turing machines was shortly proved to be undecidable, with a reduction of the halting problem with empty counters in 2-reversible Counter machines. Unfortunately, the same proof could not be used to prove undecidability of Speed Positiveness. In this research, we prove the undecidability of Homogeneous Tape Reachability Problem for aperiodic and reversible Turing machines, in order to use it to prove the undecidability of the Speed Positiveness Problem for complete and reversible Turing machines.

On the termination and structural termination problems for counter machines with incrementing errors

In contrast to their reliable and lossy-error counterparts whose termination problems are either undecidable or non-primitive recursive, the termination problem for counter machines with incrementing errors is shown to be ExpSpace-complete. It is also shown that the structural termination problem—deciding whether every run terminates from any starting configuration—for counter machines with incrementing errors is similarly ExpSpace-complete. This stands in marked contrast to both reliable and lossy counter machines, for which the problem is undecidable. The ExpSpace-hardness proof contained herein requires an unbounded supply of counters. Indeed, by fixing the number of available counters, optimal NLogSpace-complete bounds for both the termination and structural termination problems are obtained.

LTL-Specification of Counter Machines

The article is written in support of the educational discipline “Non-classical logics”. Within the framework of this discipline, the objects of study are the basic principles and constructive elements, with the help of which the formal construction of various non-classical propositional logics takes place. Despite the abstractness of the theory of non-classical logics, in which the main attention is paid to the strict mathematical formalization of logical reasoning, there are real practical areas of application of theoretical results. In particular, languages of temporal modal logics are widely used for modeling, specification, and verification (correctness analysis) of logic control program systems. This article demonstrates, using the linear temporal logic LTL as an example, how abstract concepts of non-classical logics can be reƒected in practice in the field of information technology and programming. We show the possibility of representing the behavior of a software system in the form of a set of LTL-formulas and using this representation to verify the satisfiability of program system properties through the procedure of proving the validity of logical inferences, expressed in terms of the linear temporal logic LTL. As program systems, for the specification of the behavior of which the LTL logic will be applied, Minsky counter machines are considered. Minsky counter machines are one of the ways to formalize the intuitive concept of an algorithm. They have the same computing power as Turing machines. A counter machine has the form of a computer program written in a high-level language, since it contains variables called counters, and conditional and unconditional jump operators that allow to build loop constructions. It is known that any algorithm (hypothetically) can be implemented in the form of a Minsky three-counter machine.

Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity

It is shown that for every language family that is a trio containing only semilinear languages, all bounded languages in it can be accepted by one-way deterministic reversal-bounded multicounter machines (DCM). This implies that for every semilinear trio (where these properties are effective), it is possible to decide containment, equivalence, and disjointness concerning its bounded languages. A condition is also provided for when the bounded languages in a semilinear trio coincide exactly with those accepted by DCM machines, and it is used to show that many grammar systems of finite index — such as finite-index matrix grammars (Mfin) and finite-index ET0L (ET0Lfin) — have identical bounded languages as DCM.Then connections between ambiguity, counting regularity, and commutative regularity are made, as many machines and grammars that are unambiguous can only generate/accept counting regular or commutatively regular languages. Thus, such a system that can generate/accept a non-counting regular or non-commutatively regular language implies the existence of inherently ambiguous languages over that system. In addition, it is shown that every language generated by an unambiguous Mfin has a rational characteristic series in commutative variables, and is counting regular. This result plus the connections are used to demonstrate that the grammar systems Mfin and ET0Lfin can generate inherently ambiguous languages (over their grammars), as do several machine models. It is also shown that all bounded languages generated by these two grammar systems (those in any semilinear trio) can be generated unambiguously within the systems. Finally, conditions on Mfin and ET0Lfin languages implying commutative regularity are obtained. In particular, it is shown that every finite-index ED0L language is commutatively regular.

Weak Cost Register Automata are Still Powerful

We consider one of the weakest variants of cost register automata over a tropical semiring, namely copyless cost register automata over [Formula: see text] with updates using [Formula: see text] and increments. We show that this model can simulate, in some sense, the runs of counter machines with zero-tests. We deduce that a number of problems pertaining to that model are undecidable, namely equivalence, upperboundedness, and semilinearity. In particular, the undecidability of equivalence disproves a conjecture of Alur et al. from 2012. To emphasize how weak these machines are, we also show that they can be expressed as a restricted form of linearly-ambiguous weighted automata.

On families of full trios containing counter machine languages

We look at nondeterministic finite automata augmented with multiple reversal-bounded counters where, during an accepting computation, the behavior of the counters is specified by some fixed pattern. These patterns can serve as a useful “bridge” to other important automata and grammar models in the theoretical computer science literature, thereby helping in their study. Various pattern behaviors are considered, together with characterizations and comparisons. For example, one such pattern defines exactly the smallest full trio containing all the bounded semilinear languages. Another pattern defines the smallest full trio containing all the bounded context-free languages. The “bridging” to other families is then applied, e.g. to certain Turing machine restrictions, as well as other families. Certain general decidability properties are also studied using this framework.

Pattern of clinical and hematological profile in patients diagnosed as megaloblastic anemia in a tertiary care centre

Objectives: To determine the pattern of clinical presentation, pattern of cytopenias, and haematological parameters of megaloblastic anemia in our setup. Study Design: Cross Sectional Descriptive study. Setting: Pathology Department, Khyber Teaching Hospital, Peshawar. Duration: January 2016 to December 2016 (one year period). Material and Methods: A total of 337 patients underwent bone marrow biopsy during the study period, out of which 46 patients were diagnosed as having megaloblastic anemia on bone marrow aspirate and B12 levels. The clinical features and hematological parameters of these patients were recorded in a proforma and the results were drawn accordingly. All cell counts were done on automated counter machine. Results: Out of 337 patients referred to pathology department for bone marrow aspiration, about 45 cases had megaloblastic anemia. These 45 cases were included in the study. Age of the study sample ranged from 1 year to 90 years (mean 32.2 years ± 12.1 SD). There were 35 (78%) males and 10 (22%) females, with male to female ratio of 3.5:1. Commonest clinical feature was generalized weakness and loose motion, while commonest physical sign was pallor, which were seen in 36 (80%), 36 (80%) and 40 (88%) cases respectively. About 28 (62%) patients had pancytopenia, 9 (20%) patients had bicytopenia (low hemoglobin and platelet count), and 8 (18%) cases had isolated anemia. Low Hb was present in all the 45 (100%) patients. Both the mean hemoglobin level and platelet count were reduced (7.4g/dL and 128x109/L. respectively) while mean white cell count in study sample was normal (mean 5.0x109/L). Conclusion: Megaloblastic anemia may presents as anemia, bicytopenia or pancytopenia. The cytopenias are important feature of megaloblastic anemia. Generalized weakness, and lethargy are the common clinical presentation, while pallor is common physical finding. Patients presenting with a constellation of generalized weakness, pallor and pancytopenia should be suspected of megaloblastic anemia and should be investigated accordingly.

Stack and register complexity of radix conversions

We investigate the question of computational resources (such as stacks and counters) necessary to perform radix conversions. To this end it is shown that no PDA can compute the significand of the best n-digit floating point approximation of a power of an incommensurable radix. This extends the results of W. Clinger. We also prove that a two counter machine with input is capable of such conversions. On the other hand we note a curious asymmetry with respect to the order in which the digits are input by showing that a two counter machine can decode its input online if the digits are presented in the most-to-least significant order while no such machine can decode its input in this manner if the digits are presented in the least-to-most significant order. Some structural results about two counter machines (with input) are also established.

Application of Chopper Machinery Technology from Oil Palm Fronds in Huta Gondang Rejo Nagori Bandar Tongah Bandar Hands, Regency of Simalungun

This community service activity aims to improve the efficiency of cattle farm business in Huta Gondang Rejo Nagori Bandar Tongah Bandar Huluan Subdistrict Simalungun Regency through the use of pellet complete feed based on palm oil fronds and agricultural waste. This activity is conducted on cattle ranchers who are members of the farming community group Huta Gondang Rejo. Farmers are given counseling and training on the processing of palm oil fronds and agricultural waste into livestock feed and the establishment of a complete ration of palm-based pellet and agricultural waste. To facilitate the transfer of this technology to the breeder, then prepared a complete feed pellet with 5 types of machines. Palm Crusher Counter Machines or Palm Crafter Engines with a capacity of 600 kg/hour. Pellet printing machine (granulator) with capacity of 100 kg/hour. Mixer machine (mixer feed) with a capacity of 50 kg/stir. Dryer (Oven) with capacity of 10 kg/rack. Manual press feed press tool with specification 2 kg/print. Measuring the success of this activity is seen from the level of farmer adoption of pelleting technology and the difference of ration conversion between cattle that get complete feed and conventional or traditional. Performance of palm cropping machine for cattle that get complete pellet feed is better than cattle that get conventional or traditional feed. This Chopper machine can count the palm stem from the tip of the base of the leaf to the stem (80% of the palm stem). Through the activities of plant waste feed technology is expected to achieve some outcomes, namely, improve the productivity of farming through the system integration of livestock combine farming system with synergistic system to form an effective, efficient and environmentally friendly.

Feasibility of mean platelet volume in predicting neonatal morbidity in pre-eclamptic pregnancies

Background: Mean platelet volume (MPV) is a measurement of the average size of platelets found in blood. The average platelet size is larger when the body is producing increased numbers of platelets. Hence, the MPV test results can be used to make inferences about platelet production in bone marrow or platelet destruction problems. MPV is higher when there is destruction of platelets. Since pregnancy is a hypercoagulable state and pre-eclampsia is one of the risk factors associated with low birth weight babies and fetal growth retardation, the newborns of hypertensive mothers should thus be very carefully evaluated in terms of platelet abnormalities. Aims and Objectives: This study aims to study the MPV and platelet counts in neonates born of pre-eclamptic and normal pregnancies. Materials and Methods: This is a case–control study performed in the department of physiology in collaboration with other departments. A total of 40 cases and 40 controls were enrolled. Venous blood from mothers was collected in ethylenediaminetetraacetic acid vials. MPV was assessed using an automated cell counter machine placed in hospital laboratory service. Results: In the present study, the values of MPV in neonates of case group (10.2 ± 0.94 fL) and control group (10.01 ± 1.06 fL) are approximately the same and not significant (P > 0.05). Conclusion: Our results showed that platelet counts showed significant decrease in the case group compared to controls while the levels of MPV did not differ much among patients with pre-eclampsia and healthy pregnant women. Further studies are needed to explore the adequacy of MPV as a marker of pre-eclampsia.

Uji Kinerja Mesin Pencacah Plastik (Studi Kasus Bank Sampah Tasikmalaya (BST) di Kecamatan Singaparna, Kabupaten Tasikmalaya)

ABSTRACTGarbage is solid waste, consisting of organic and inorganic substances or materials that are considered to have no longer beneficial and must be managed properly so as not to endanger the environment. Garbage has been a complicated problem especially in big cities. Singaparna, Tasikmalaya has been produced 154.72 m3 of plastic waste every day. Plastic waste collected by BST is only sort and sold at low prices to the city. To increase the sale value, the plastic waste needs to be chopped in advance. Therefore, the Laboratory of Agricultural Equipment and Machinery FTIP Unpad had developed a plastic waste counting machine to be applied to the community, especially in BST to produce the desired plastic count. However, this machine not yet performance testing data, so it needs to do research regarding performance tests. The purpose of this study is to examine the performance of the plastic counter machine which includes measuring the capacity of the machine, calculating the rendering yield, calculating the length of the enumeration measuring the engine noise level and measuring the engine vibration level. The research method used had descriptive analysis method, it was measuring and calculating the structural components and engine performance. The results of the study in measuring the performance test showed that the actual capacity of the machine was 19.18 kg / hour, the enumeration chopper was 84%, the percentage of plastic chopping length was 86.89%, the noise level was 104.77dB, and the engine vibration was 18.3 mm / s. Key Note : plastic chopper, performance test, tasikmalaya garbage bank

Computation power of asynchronous spiking neural P systems with polarizations

Spiking neural P systems (SN P systems) are a class of parallel computing models, inspired by the way in which neurons process information and communicate to each other by means of spikes. In this work, we consider a variant of SN P systems, SN P systems with polarizations (PSN P systems), where the integrate-and-fire conditions are associated with polarizations of neurons. The computation power of PSN P systems working in the asynchronous mode (at a computation step, a neuron with enabled rules does not obligatorily fire), instead of the synchronous mode (a neuron with enabled rules should fire), is investigated. We proved that asynchronous PSN P systems with extended rules (the application of a rule can produce more than one spikes) or standard rules (all rules can only produce a spike) can both characterize partially blind counter machines, hence, such systems are not Turing universal. The equivalence of the computation power of asynchronous PSN P systems in both cases of using extended rules or standard rules indicates that asynchronous PSN P systems are robust in terms of the amount of information exchanged among neurons. It is known that synchronous PSN P systems with standard rules are Turing universal, so these results also suggest that the working model, synchronization or asynchronization, is an essential ingredient for a PSN P system to achieve a powerful computation capability.

Pembuatan Mesin Pencacah Sampah Organik Untuk Swadaya Pupuk di Desa Tancep Kecamatan Ngawen Kabupaten Gunungkidul

To improve agricultural and plantation yields, farmers need fertilizer. Currently the problems faced by farmers in Tancep Village Ngawen District Gunungkidul Regency is the scarcity and high price of fertilizer. On the other hand, the area has great potential, in the form of availability of organic materials and animal manure that can be utilized as fertilizer. In this community service the knowledge and simple technology to process waste and other organic materials into compost were given. The process of making compost requires the process of chopping garbage or organic materials, such as wet leaves and twigs, so that the pieces are small. For that in this activity needs to be done making garbage chopper machine or organic materials. An organic waste counter machine is made with a rotary blade construction consisting of 12 blades. The construction of a machine is made portable with a propulsion in the form of a gasoline engine, so the machine is easily moved and operated indoors or outdoors. Through community service activities in Tancep Village, Ngawen Subdistrict, Gunungkidul Regency has formed a garbage bank managed by Karang Taruna group. In addition to collecting and reselling of inorganic waste, the activity developed is processing organic waste into compost. Through the knowledge and equipment owned, it is expected that the compost fertilizer produced can help meet the needs of fertilizer for local farmers to self-help fertilizer.

Uncountable classical and quantum complexity classes

It is known that poly-time constant-space quantum Turing machines (QTMs) and logarithmic-space probabilistic Turing machines (PTMs) recognize uncountably many languages with bounded error (A.C. Cem Say and A. Yakaryılmaz, Magic coins are useful for small-space quantum machines. Quant. Inf. Comput. 17 (2017) 1027–1043). In this paper, we investigate more restricted cases for both models to recognize uncountably many languages with bounded error. We show that double logarithmic space is enough for PTMs on unary languages in sweeping reading mode or logarithmic space for one-way head. On unary languages, for quantum models, we obtain middle logarithmic space for counter machines. For binary languages, arbitrary small non-constant space is enough for PTMs even using only counter as memory. For counter machines, when restricted to polynomial time, we can obtain the same result for linear space. For constant-space QTMs, we obtain the result for a restricted sweeping head, known as restarting realtime.

Insertion operations on deterministic reversal-bounded counter machines

Several insertion operations are studied applied to languages accepted by one-way and two-way deterministic reversal-bounded multicounter machines. These operations are defined by the ideals obtained from relations such as the prefix, infix, suffix, and outfix relations, as well as operations defined from inverses of a type of deterministic transducer with reversal-bounded counters attached. The question of whether the resulting languages can always be accepted by deterministic machines with the same number (or larger number) of input-turns (resp., counters, counter-reversals, etc.) is investigated.

Computations on Counter Machines with Summator

A new class of abstract computational devices, counter machines with summator (CS machines), is introduced. It is shown that CS machines are universal computational devices: any general recursive function can be strictly computed on an appropriate CS machine.

Designing portable chopping plastic waste machine utilizing electric motor

Waste management in Indonesia is still a problem that can not be handled properly. Waste reduction activities both in the community as waste producers and at the level of the area is still small, so the waste is disposed to the final processing place (TPA) while the landfill is very limited. Plastic waste is a waste that needs to be handled properly, because plastic waste is a waste that can not be broken down by microorganisms. Plastic waste can last for years causing environmental pollution. The design of a portable plastic waste counter machine aims to create a waste recycling tool, so that waste can be recycled into useful items and and create an environmental balance. To focus the manufacture of this crusher, the manufacture is limited to making non-organic waste composting machine design that is plastic waste. The design results are expected to be applied properly and can destroy the waste into granules so it can be reprocessed. The hope of this recycling process is to reduce the amount of plastic waste and make it an item that has economic value.

Nondeterministic seedless oritatami systems and hardness of testing their equivalence

The oritatami system (OS) is a model of computation by cotranscriptional folding, being inspired by the recent experimental succeess of RNA origami to self-assemble an RNA tile cotranscriptionally. The OSs implemented so far, including binary counter and Turing machine simulator, are deterministic, that is, uniquely fold into one conformation, while nondeterminism is intrinsic in biomolecular folding. We introduce nondeterminism to OS (NOS) and propose an NOS that chooses an assignment of Boolean values nondeterministically and evaluates a logical formula on the assignment. This NOS is seedless in the sense that it does not require any initial conformation to begin with like the RNA origami. The NOS allows to prove the co-NP hardness of deciding, given two NOSs, if there exists no conformation that one of them folds into but the other does not.

IbM Pengolahan Sampah Plastik Dalam Rangka Pemberdayaan Masyarakat Kelurahan Muktiharjo Kidul Semarang

Community service activities of science and technology program for Plastic Waste Processing Society isimplemented as a form of concern for environmental sustainability. Given the plastic waste is waste that takes time todecompose 50-100 years. On the other hand the potential of plastic waste in Pedurungan Sub-district of Semarang is verylarge. If plastic waste can be processed and managed optimally it will greatly reduce the amount of plastic waste in thearea, besides also can increase people's income. This activity was held in Muktiharjo Kidul Village, PedurunganSubdistrict, Semarang. Participants of 30 people who are members of KSM Mandiri Santoso Jaya and KSM Tri AsihJaya. Implementation in the form of (1) Socialization of Ibm's program of activity; (2) Manufacture of plastic garbagedisposal machines; (3) Training of the use of plastic counter machine; and (4) Assistance for consultation. The methodsused from socialization to mentoring are lectures, frequently asked questions, and practices. IbM activities are getting agood response marked by the antuasiasme of the participants in following every stage of the activity. The result of thisdedication activity is the reduction of plastic waste amount by recycle effort, increasing the family income throughincreasing the economic value of plastic waste, increasing the quality of activity in the garbage bank