Log in

Relevant bibliographies by topics / Randomness / Journal articles

Journal articles on the topic 'Randomness'

To see the other types of publications on this topic, follow the link: Randomness.

Author: Grafiati

Published: 4 June 2021

Last updated: 10 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Randomness.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Landsman, Klaas. "Randomness? What Randomness?" Foundations of Physics 50, no. 2 (January 18, 2020): 61–104. http://dx.doi.org/10.1007/s10701-020-00318-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bartko, John J. "Randomness." Journal of Nervous & Mental Disease 187, no. 7 (July 1999): 448–50. http://dx.doi.org/10.1097/00005053-199907000-00011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Bennett, Deborah J., and Stephen Gasiorowicz. "Randomness." Physics Today 52, no. 1 (January 1999): 68–69. http://dx.doi.org/10.1063/1.882575.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Rute, Jason. "When does randomness come from randomness?" Theoretical Computer Science 635 (July 2016): 35–50. http://dx.doi.org/10.1016/j.tcs.2016.05.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Yu, Liang. "Characterizing strong randomness via Martin-Löf randomness." Annals of Pure and Applied Logic 163, no. 3 (March 2012): 214–24. http://dx.doi.org/10.1016/j.apal.2011.08.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Haug, Espen Gaarder. "Philosophy of Randomness: Limited or Unlimited Randomness?" Wilmott 2018, no. 96 (July 2018): 10–13. http://dx.doi.org/10.1002/wilm.10684.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Perminov, N. S., O. I. Bannik, D. Yu Tarankova, and R. R. Nigmatullin. "Correlation Defense for Quantum Randomness." Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki 162, no. 1 (2020): 98–106. http://dx.doi.org/10.26907/2541-7746.2020.1.98-106.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Diener, Don, and W. Burt Thompson. "Recognizing Randomness." American Journal of Psychology 98, no. 3 (1985): 433. http://dx.doi.org/10.2307/1422628.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Dotsenko, Viktor S. "Universal randomness." Physics-Uspekhi 54, no. 3 (March 31, 2011): 259–80. http://dx.doi.org/10.3367/ufne.0181.201103b.0269.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Downey, Rodney G., and Evan J. Griffiths. "Schnorr randomness." Journal of Symbolic Logic 69, no. 2 (June 2004): 533–54. http://dx.doi.org/10.2178/jsl/1082418542.

Full text

Abstract:

Abstract.Schnorr randomness is a notion of algorithmic randomness for real numbers closely related to Martin-Löf randomness. After its initial development in the 1970s the notion received considerably less attention than Martin-Löf randomness, but recently interest has increased in a range of randomness concepts. In this article, we explore the properties of Schnorr random reals, and in particular the c.e. Schnorr random reals. We show that there are c.e. reals that are Schnorr random but not Martin-Löf random, and provide a new characterization of Schnorr random real numbers in terms of prefix-free machines. We prove that unlike Martin-Löf random c.e. reals, not all Schnorr random c.e. reals are Turing complete, though all are in high Turing degrees. We use the machine characterization to define a notion of “Schnorr reducibility” which allows us to calibrate the Schnorr complexity of reals. We define the class of “Schnorr trivial” reals, which are ones whose initial segment complexity is identical with the computable reals, and demonstrate that this class has non-computable members.

APA, Harvard, Vancouver, ISO, and other styles

11

de Ruyter, Rob. "Randomness unbound." Physics Today 75, no. 1 (January 1, 2022): 51–52. http://dx.doi.org/10.1063/pt.3.4923.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Kalman, Rudolph E. "Randomness reexamined." Modeling, Identification and Control: A Norwegian Research Bulletin 15, no. 3 (1994): 141–51. http://dx.doi.org/10.4173/mic.1994.3.3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Denning, Peter J. "Rethinking Randomness." Ubiquity 2016, August (August 31, 2016): 1–17. http://dx.doi.org/10.1145/2986329.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Denning, Peter J. "Rethinking Randomness." Ubiquity 2016, August (August 31, 2016): 1–10. http://dx.doi.org/10.1145/2986331.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Franklin, Johanna N. Y., and Keng Meng Ng. "Difference randomness." Proceedings of the American Mathematical Society 139, no. 01 (January 1, 2011): 345. http://dx.doi.org/10.1090/s0002-9939-2010-10513-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Green, David. "Recognising Randomness." Teaching Statistics 19, no. 2 (June 1997): 36–39. http://dx.doi.org/10.1111/j.1467-9639.1997.tb00324.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Bubnova, Olga. "Growing randomness." Nature Nanotechnology 13, no. 1 (January 2018): 4. http://dx.doi.org/10.1038/s41565-017-0058-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Dotsenko, Viktor S. "Universal randomness." Uspekhi Fizicheskih Nauk 181, no. 3 (2011): 269. http://dx.doi.org/10.3367/ufnr.0181.201103b.0269.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Scarani, Valerio. "Guaranteed randomness." Nature 464, no. 7291 (April 2010): 988–89. http://dx.doi.org/10.1038/464988a.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Taylor, Greg, and George Cox. "Digital randomness." IEEE Spectrum 48, no. 9 (September 2011): 32–58. http://dx.doi.org/10.1109/mspec.2011.5995897.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Calude, C. S., and G. J. Chaitin. "Randomness everywhere." Nature 400, no. 6742 (July 1999): 319–20. http://dx.doi.org/10.1038/22435.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Foley, J. F. "Organized Randomness." Science Signaling 3, no. 130 (July 13, 2010): ec210-ec210. http://dx.doi.org/10.1126/scisignal.3130ec210.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Markovic, N. "Randomness rules." Science 350, no. 6260 (October 29, 2015): 509. http://dx.doi.org/10.1126/science.aad4136.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Fetzer, Susan J. "Considering Randomness." Journal of PeriAnesthesia Nursing 33, no. 6 (December 2018): 1008–9. http://dx.doi.org/10.1016/j.jopan.2018.09.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Aaronson, Scott. "Quantum Randomness." American Scientist 102, no. 4 (2014): 266. http://dx.doi.org/10.1511/2014.109.266.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Tapiero, Charles S., and Pierre Vallois. "Fractional randomness." Physica A: Statistical Mechanics and its Applications 462 (November 2016): 1161–77. http://dx.doi.org/10.1016/j.physa.2016.05.053.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Miller, Joseph S., and Jason Rute. "Energy randomness." Israel Journal of Mathematics 227, no. 1 (July 21, 2018): 1–26. http://dx.doi.org/10.1007/s11856-018-1731-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Anirban, Ankita. "Resonating randomness." Nature Reviews Materials 5, no. 1 (December 12, 2019): 1. http://dx.doi.org/10.1038/s41578-019-0173-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Hänggi, Peter. "Harvesting randomness." Nature Materials 10, no. 1 (December 15, 2010): 6–7. http://dx.doi.org/10.1038/nmat2925.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Pàmies, Pep. "Tiling randomness." Nature Materials 11, no. 1 (December 15, 2011): 8. http://dx.doi.org/10.1038/nmat3218.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Downey, Rodney, and Jan Reimann. "Algorithmic randomness." Scholarpedia 2, no. 10 (2007): 2574. http://dx.doi.org/10.4249/scholarpedia.2574.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Cohen, Imogen. "On randomness." Target. International Journal of Translation Studies 30, no. 1 (January 25, 2018): 3–23. http://dx.doi.org/10.1075/target.14124.coh.

Full text

Abstract:

Abstract Andrew Chesterman’s 2008 article “On Explanation” examines what it means to explain translational phenomena. In doing so, it explores the nature of explanation itself and raises one crucial question: How much is beyond explanation? In other words, to what extent could translational phenomena be due to mere chance? This article addresses this question by drawing on six landmark experiments within the field of psychology. These experiments suggest (1) that we, as translators, might unknowingly be injecting random elements into our translations, and (2) that we, as Translation Studies scholars, might be ‘seeing’ causes in that randomness where there are none. This article also draws on psychologist Daniel Kahneman’s ideas about the ‘illusion of causation’ and on Nassim Taleb’s definition of randomness within the humanities and social sciences. It concludes by arguing that retrospective explanations of translations should pay far more than lip service to the notion of chance.

APA, Harvard, Vancouver, ISO, and other styles

33

Downey, Rod, and Denis R. Hirschfeldt. "Algorithmic randomness." Communications of the ACM 62, no. 5 (April 24, 2019): 70–80. http://dx.doi.org/10.1145/3319408.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Downey, Rod, Denis R. Hirschfeldt, André Nies, and Sebastiaan A. Terwijn. "Calibrating Randomness." Bulletin of Symbolic Logic 12, no. 3 (September 2006): 411–91. http://dx.doi.org/10.2178/bsl/1154698741.

Full text

Abstract:

We report on some recent work centered on attempts to understand when one set is more random than another. We look at various methods of calibration by initial segment complexity, such as those introduced by Solovay [125], Downey, Hirschfeldt, and Nies [39], Downey, Hirschfeldt, and LaForte [36], and Downey [31]; as well as other methods such as lowness notions of Kučera and Terwijn [71], Terwijn and Zambella [133], Nies [101, 100], and Downey, Griffiths, and Reid [34]; higher level randomness notions going back to the work of Kurtz [73], Kautz [61], and Solovay [125]; and other calibrations of randomness based on definitions along the lines of Schnorr [117].These notions have complex interrelationships, and connections to classical notions from computability theory such as relative computability and enumerability. Computability figures in obvious ways in definitions of effective randomness, but there are also applications of notions related to randomness in computability theory. For instance, an exciting by-product of the program we describe is a more-or-less naturalrequirement-freesolution to Post's Problem, much along the lines of the Dekker deficiency set.

APA, Harvard, Vancouver, ISO, and other styles

35

Goldstein, Harrison, and Benjamin C. Pierce. "Parsing randomness." Proceedings of the ACM on Programming Languages 6, OOPSLA2 (October 31, 2022): 89–113. http://dx.doi.org/10.1145/3563291.

Full text

Abstract:

Random data generators can be thought of as parsers of streams of randomness. This perspective on generators for random data structures is established folklore in the programming languages community, but it has never been formalized, nor have its consequences been deeply explored. We build on the idea of freer monads to develop free generators, which unify parsing and generation using a common structure that makes the relationship between the two concepts precise. Free generators lead naturally to a proof that a monadic generator can be factored into a parser plus a distribution over choice sequences. Free generators also support a notion of derivative, analogous to the familiar Brzozowski derivatives of formal languages, allowing analysis tools to "preview" the effect of a particular generator choice. This gives rise to a novel algorithm for generating data structures satisfying user-specified preconditions.

APA, Harvard, Vancouver, ISO, and other styles

36

Miyabe, Kenshi. "Truth-table Schnorr randomness and truth-table reducible randomness." Mathematical Logic Quarterly 57, no. 3 (March 7, 2011): 323–38. http://dx.doi.org/10.1002/malq.200910128.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Bhojraj, Tejas. "Quantum algorithmic randomness." Journal of Mathematical Physics 62, no. 2 (February 1, 2021): 022202. http://dx.doi.org/10.1063/5.0003351.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Karasev, Leonid V. "Randomness and Loneliness." Voprosy Filosofii, no. 5 (2020): 210–14. http://dx.doi.org/10.21146/0042-8744-2020-5-210-214.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Duhrkopf, Richard. "Reality & Randomness." American Biology Teacher 52, no. 7 (October 1, 1990): 436–38. http://dx.doi.org/10.2307/4449160.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Buss, Sam, and Mia Minnes. "Probabilistic Algorithmic Randomness." Journal of Symbolic Logic 78, no. 2 (June 2013): 579–601. http://dx.doi.org/10.2178/jsl.7802130.

Full text

Abstract:

AbstractWe introduce martingales defined by probabilistic strategies, in which randomness is used to decide whether to bet. We show that different criteria for the success of computable probabilistic strategies can be used to characterize ML-randomness, computable randomness, and partial computable randomness. Our characterization of ML-randomness partially addresses a critique of Schnorr by formulating ML randomness in terms of a computable process rather than a computably enumerable function.

APA, Harvard, Vancouver, ISO, and other styles

41

Osterloh, Margit, and Bruno S. Frey. "Dealing With Randomness." management revue 30, no. 4 (2019): 331–45. http://dx.doi.org/10.5771/0935-9915-2019-4-331.

Full text

Abstract:

Decisions based on randomness are often taken to be “irrational” or “arbitrary”. The conventional strategy is to fight randomness; a more recent one is to accept and even celebrate randomness. We focus on a third approach that employs randomness as a managerial and social decision-making mechanism in a purposeful way. We argue that Controlled Random Decisions provide considerable advantages. They allow outsiders as well as novel ideas to have an influence, and they work against corruption. When persons and projects are selected, there must be a careful pre-selection. Controlled Random Decisions should be discussed and employed more extensively.

APA, Harvard, Vancouver, ISO, and other styles

42

Downey, Rod, and Denis R. Hirschfeldt. "Computability and Randomness." Notices of the American Mathematical Society 66, no. 07 (August 1, 2019): 1. http://dx.doi.org/10.1090/noti1905.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Zhou, Guo-Ping. "Mission of randomness." Virulence 4, no. 8 (November 15, 2013): 669–70. http://dx.doi.org/10.4161/viru.27136.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Dembski, William A. "Randomness By Design." Noûs 25, no. 1 (March 1991): 75. http://dx.doi.org/10.2307/2216094.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

AYTON, PETER, and GEORGE WRIGHT. "Tests for Randomness?" Teaching Mathematics and its Applications 6, no. 2 (1987): 83–87. http://dx.doi.org/10.1093/teamat/6.2.83.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Bienvenu, Laurent, Rupert Hölzl, Christopher P. Porter, and Paul Shafer. "Randomness and Semimeasures." Notre Dame Journal of Formal Logic 58, no. 3 (2017): 301–28. http://dx.doi.org/10.1215/00294527-3839446.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Chaitin, Gregory J. "Randomness in Arithmetic." Scientific American 259, no. 1 (July 1988): 80–85. http://dx.doi.org/10.1038/scientificamerican0788-80.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

KYBURG, HENRY E. "Probability and randomness." Theoria 29, no. 1 (February 11, 2008): 27–55. http://dx.doi.org/10.1111/j.1755-2567.1963.tb00052.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Alaghi, Armin, and John P. Hayes. "Computing with Randomness." IEEE Spectrum 55, no. 3 (March 2018): 46–51. http://dx.doi.org/10.1109/mspec.2018.8302387.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Baldwin, John T., and Saharon Shelah. "Randomness and semigenericity." Transactions of the American Mathematical Society 349, no. 4 (1997): 1359–76. http://dx.doi.org/10.1090/s0002-9947-97-01869-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!