Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
deterministic computation
Description:
A mode of computation in which the same inputs and initial conditions always produce the same outputs and computational trajectory.
OpenAlex ID:
keywords/deterministic-computation
Adaptive Computation Time for Recurrent Neural Networks
2016
·
Graves, Alex
·
arXiv (Cornell University)
·
1,042
PDF
Tools and techniques for computational reproducibility
2016
·
Stephen R. Piccolo
, Michael B. Frampton
·
GigaScience
·
204
Generalized flow and determinism in measurement-based quantum computation
2007
·
Daniel E Browne
, Elham Kashefi
, et al.
·
New Journal of Physics
·
197
PDF
A reversible programming language and its invertible self-interpreter
2007
·
Tetsuo Yokoyama
, Robert Glück
·
ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM)
·
170
Deterministic function computation with chemical reaction networks
2013
·
Ho-Lin Chen
, David Doty
, et al.
·
Natural Computing
·
158
ELAN
1996
·
Peter Borovanský
, Claude Kirchner
, et al.
·
Electronic Notes in Theoretical Computer Science
·
133
Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
2010
·
Tseren-Onolt Ishdorj
, Alberto Leporati
, et al.
·
Theoretical Computer Science
·
126
PDF
Random polynomial time is equal to slightly-random polynomial time
1985
·
Umesh V. Vazirani
, Vijay V. Vazirani
·
Annual Symposium on Foundations of Computer Science
·
113
Solving HPP and SAT by P Systems with Active Membranes and Separation Rules
2006
·
Linqiang Pan
, Artiom Alhazov
·
Acta Informatica
·
90
Using enzymatic numerical P systems for modeling mobile robot controllers
2011
·
Ana Brânduşa Pavel
, Cătălin Buiu
·
Natural Computing
·
77
Quantum Advantage from Sequential-Transformation Contextuality
2018
·
Shane Mansfield
, Elham Kashefi
·
Physical Review Letters
·
66
PDF
Combinatorial Lower Bound Arguments for Deterministic and Nondeterministic Turing Machines
1985
·
Wolfgang Maass
·
Transactions of the American Mathematical Society
·
58
PDF
Relating refined space complexity classes
1977
·
Joel I. Seiferas
·
Journal of Computer and System Sciences
·
56
PDF
On the size of sets of computable functions
1973
·
Kurt Mehlhorn
·
Annual Symposium on Switching & Automata Theory
·
51
Which Graph States are Useful for Quantum Information Processing?
2014
·
Mehdi Mhalla
, Mio Murao
, et al.
·
Lecture notes in computer science
·
48
PDF
An Approach to Computational Complexity in Membrane Computing
2005
·
Mario J. Pérez-Jiménez
·
Lecture notes in computer science
·
48
TFT: a software system for application-transparent fault tolerance
2002
·
T.C. Bressoud
·
IEEE International Symposium on Fault-Tolerant Computing
·
44
Tape versus queue and stacks: The lower bounds
1988
·
Ming Li
, Paul M.B. Vitányi
·
Information and Computation
·
44
Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources
2008
·
Tseren-Onolt Ishdorj
, Alberto Leporati
·
Natural Computing
·
43
Counting rational points on curves and abelian varieties over finite fields
1996
·
Leonard M. Adleman
, Ming-Deh A. Huang
·
Lecture notes in computer science
·
42
Bounded query machines: On NP and PSPACE
1981
·
Ronald V. Book
·
Theoretical Computer Science
·
41
PDF
Counting Points on Curves and Abelian Varieties Over Finite Fields
2001
·
Leonard M. Adleman
, Ming-Deh Huang
·
Journal of Symbolic Computation
·
40
Strange nonchaotic attractors for computation
2018
·
M. Sathish Aravindh
, A. Venkatesan
, et al.
·
Physical review. E
·
39
PDF
Fundamental limitations for anonymous distributed systems with broadcast communications
2015
·
Julien M. Hendrickx
, John N. Tsitsiklis
·
Allerton Conference on Communication, Control, and Computing
·
39
Leaderless deterministic chemical reaction networks
2014
·
David Doty
, Monir Hajiaghayi
·
Natural Computing
·
35
Show more works
View as search
Works count:
419
Citation count:
3,940
Year
Topic
Type