Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Universality probability

Known as: Universality 
Given a prefix-free Turing machine, the universality probability of it is the probability that it remains universal even when every input of it (as a… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
flavio is an open source tool for phenomenological analyses in flavour physics and other precision observables in the Standard… Expand
  • table 1
  • table 2
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Trends in electrocatalytic activity of the oxygen evolution reaction (OER) are investigated on the basis of a large database of… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Topological insulators are materials with a bulk excitation gap generated by the spin-orbit interaction that are different from… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
Highly Cited
1999
Highly Cited
1999
  • D. Landau
  • Computing in Science & Engineering
  • 1999
  • Corpus ID: 9853868
The examination of phase transitions and critical phenomena has dominated statistical physics for the latter half of this century… Expand
  • figure 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
. . . In print, at least, what might seem arrogant comes across as a kind of innocent, childlike enthusiasm, a lack of concern… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
There is universality in the transactional-transformational leadership paradigm. That is, the same conception of phenomena and… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Alur, R. and D.L. Dill, A theory of timed automata, Theoretical Computer Science 126 (1994) 183-235. We propose timed (j&e… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1983
Highly Cited
1983
Abstract Cellular automata are discrete dynamical systems with simple construction but complex self-organizing behaviour… Expand
  • table I
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1978
Highly Cited
1978
AbstractA large class of recursion relationsxn + 1 = λf(xn) exhibiting infinite bifurcation is shown to possess a rich… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1976
Highly Cited
1976
Computer science is the study of the phenomena surrounding computers. The founders of this society understood this very well when… Expand
Is this relevant?