Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,434,877 papers from all fields of science
Search
Sign In
Create Free Account
Counter machine
A counter machine is an abstract machine used in formal logic and theoretical computer science to model computation. It is the most primitive of the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
29 relations
Abstract machine
Algorithm characterizations
Andrey Ershov
Arthur Burks
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Perancangan Sistem Transmisi Sabuk Dan Pulley Pada Modifikasi Mesin Pencacah Plastik
D. Utomo
2017
Corpus ID: 116130289
ABSTRAKModifikasi mesin pencacah plastik adalah mesin pencacah plastik yang dimodifikasi dengan mesin pemotong ring aqua gelas…
Expand
2013
2013
FORMAL VERIFICATION OF PROGRAMS FOR ABSTRACT REGISTER MACHINES
D. Chkliaev
,
V. Nepomniaschy
2013
Corpus ID: 196153855
Abstract register machines are an important formal model of computation widely used for the modeling of many classes of…
Expand
2012
2012
Athum Money Counter Machine
Reamalou V. Ungab
,
Aida May T. Francisco
,
Romeo Z. Coronado
,
Romil L. Magalan
2012
Corpus ID: 166733618
The study was intended specifically for banks, supermarket and other business establishment since it aimed to develop a device…
Expand
2009
2009
Reachability and boundedness in time-constrained MSC graphs
P. Gastin
,
M. Mukund
,
Narayan Kumar
2009
Corpus ID: 9190108
Channel boundedness is a necessary condition for a message-passing system to exhibit regular, finite-state behaviour at the…
Expand
2006
2006
Aiding the Beginning Therapist with Therapist Focusing : A Case Study
A. Ikemi
,
E. Kawata
2006
Corpus ID: 173174683
In recent years, the significance of therapists focusing on their clients has been observed and several attempts are being made…
Expand
2000
2000
METAPETRINETS FOR CONTROLLING COMPLEX AND DYNAMIC PROCESSES1
V. Terziyan
,
V. Savolainen
2000
Corpus ID: 55882163
Multilevel petrinets are proposed for facilitating flexible modeling and control of complicated dynamic processes. A metapetrinet…
Expand
1997
1997
On the Foundations of Termination Analysis of Active Database Rules
J. Bailey
1997
Corpus ID: 59906959
Traditional database systems provide a mechanism for storing large amounts of data and an interface for querying and manipulating…
Expand
1990
1990
Equivalence of propositional Prolog programs
H. K. Büning
,
U. Löwen
,
Stefan Schmitgen
Journal of automated reasoning
1990
Corpus ID: 37065853
We show that the equivalence problem for propositional Prolog programs is coNP-complete. Considering yes-no answers only the…
Expand
1981
1981
Interpretation of particle growth and aggregation patterns obtained from the Coulter counter: a simple theoretical model.
Ryall Rl
,
Ryall Rg
,
Marshall Vr
1981
Corpus ID: 234750474
We used a simple theoretical model to stimulate the changes in particle size distribution that occur when crystals grow, or…
Expand
1973
1973
A Two Counter Machine Cannot Calculate 2 sup N
R. Schroeppel
1973
Corpus ID: 124084171
Abstract : The note proves that a two counter machine cannot calculate (2 sup N). Various theorems are proven.
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE