Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Randomness)`

.
Showing records 1 – 30 of
104 total matches.

Search Limiters

Dates

- 2015 – 2019 (30)
- 2010 – 2014 (40)
- 2005 – 2009 (26)

▼ Search Limiters

University of Georgia

1. Thomas, Aileen Elizabeth. Human random capacities through repeated numeric sampling.

Degree: BS, Statistics, 2009, University of Georgia

URL: http://purl.galileo.usg.edu/uga_etd/thomas_aileen_e_200905_bs

► *Randomness* in the macroworld of human actions would contradict the theory of causal determinism, that all events occur as a direct result from antecedent factors,…
(more)

Subjects/Keywords: Randomness

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Thomas, A. E. (2009). Human random capacities through repeated numeric sampling. (Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/thomas_aileen_e_200905_bs

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Thomas, Aileen Elizabeth. “Human random capacities through repeated numeric sampling.” 2009. Thesis, University of Georgia. Accessed January 24, 2019. http://purl.galileo.usg.edu/uga_etd/thomas_aileen_e_200905_bs.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Thomas, Aileen Elizabeth. “Human random capacities through repeated numeric sampling.” 2009. Web. 24 Jan 2019.

Vancouver:

Thomas AE. Human random capacities through repeated numeric sampling. [Internet] [Thesis]. University of Georgia; 2009. [cited 2019 Jan 24]. Available from: http://purl.galileo.usg.edu/uga_etd/thomas_aileen_e_200905_bs.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Thomas AE. Human random capacities through repeated numeric sampling. [Thesis]. University of Georgia; 2009. Available from: http://purl.galileo.usg.edu/uga_etd/thomas_aileen_e_200905_bs

Not specified: Masters Thesis or Doctoral Dissertation

University of Notre Dame

2.
Quinn Culver.
Topics in Algorithmic *Randomness* and Effective
Probability</h1>.

Degree: PhD, Mathematics, 2015, University of Notre Dame

URL: https://curate.nd.edu/show/g445cc10r03

► This dissertation contains the results from three related projects, each within the fields of algorithmic *randomness* and probability theory. The first project we undertake,…
(more)

Subjects/Keywords: algorithmic randomness

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Culver, Q. (2015). Topics in Algorithmic Randomness and Effective Probability</h1>. (Doctoral Dissertation). University of Notre Dame. Retrieved from https://curate.nd.edu/show/g445cc10r03

Chicago Manual of Style (16^{th} Edition):

Culver, Quinn. “Topics in Algorithmic Randomness and Effective Probability</h1>.” 2015. Doctoral Dissertation, University of Notre Dame. Accessed January 24, 2019. https://curate.nd.edu/show/g445cc10r03.

MLA Handbook (7^{th} Edition):

Culver, Quinn. “Topics in Algorithmic Randomness and Effective Probability</h1>.” 2015. Web. 24 Jan 2019.

Vancouver:

Culver Q. Topics in Algorithmic Randomness and Effective Probability</h1>. [Internet] [Doctoral dissertation]. University of Notre Dame; 2015. [cited 2019 Jan 24]. Available from: https://curate.nd.edu/show/g445cc10r03.

Council of Science Editors:

Culver Q. Topics in Algorithmic Randomness and Effective Probability</h1>. [Doctoral Dissertation]. University of Notre Dame; 2015. Available from: https://curate.nd.edu/show/g445cc10r03

University of Notre Dame

3. Logan M. Axon. Algorithmically random closed sets and probability</h1>.

Degree: PhD, Mathematics, 2010, University of Notre Dame

URL: https://curate.nd.edu/show/kh04dn4257n

► Algorithmic *randomness* in Cantor space has recently become the *subject* of intense study. Originally defined in terms of the fair coin measure, algorithmic *randomness*…
(more)

Subjects/Keywords: effective randomness; RACS; Martin-Lof randomness

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Axon, L. M. (2010). Algorithmically random closed sets and probability</h1>. (Doctoral Dissertation). University of Notre Dame. Retrieved from https://curate.nd.edu/show/kh04dn4257n

Chicago Manual of Style (16^{th} Edition):

Axon, Logan M.. “Algorithmically random closed sets and probability</h1>.” 2010. Doctoral Dissertation, University of Notre Dame. Accessed January 24, 2019. https://curate.nd.edu/show/kh04dn4257n.

MLA Handbook (7^{th} Edition):

Axon, Logan M.. “Algorithmically random closed sets and probability</h1>.” 2010. Web. 24 Jan 2019.

Vancouver:

Axon LM. Algorithmically random closed sets and probability</h1>. [Internet] [Doctoral dissertation]. University of Notre Dame; 2010. [cited 2019 Jan 24]. Available from: https://curate.nd.edu/show/kh04dn4257n.

Council of Science Editors:

Axon LM. Algorithmically random closed sets and probability</h1>. [Doctoral Dissertation]. University of Notre Dame; 2010. Available from: https://curate.nd.edu/show/kh04dn4257n

Victoria University of Wellington

4.
Day, Adam Richard.
* Randomness* and Computability.

Degree: 2011, Victoria University of Wellington

URL: http://hdl.handle.net/10063/1647

► This thesis establishes significant new results in the area of algorithmic *randomness*. These results elucidate the deep relationship between *randomness* and computability. A number of…
(more)

Subjects/Keywords: Randomness; Computability; Computable functions; Algorithms

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Day, A. R. (2011). Randomness and Computability. (Doctoral Dissertation). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/1647

Chicago Manual of Style (16^{th} Edition):

Day, Adam Richard. “Randomness and Computability.” 2011. Doctoral Dissertation, Victoria University of Wellington. Accessed January 24, 2019. http://hdl.handle.net/10063/1647.

MLA Handbook (7^{th} Edition):

Day, Adam Richard. “Randomness and Computability.” 2011. Web. 24 Jan 2019.

Vancouver:

Day AR. Randomness and Computability. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 2011. [cited 2019 Jan 24]. Available from: http://hdl.handle.net/10063/1647.

Council of Science Editors:

Day AR. Randomness and Computability. [Doctoral Dissertation]. Victoria University of Wellington; 2011. Available from: http://hdl.handle.net/10063/1647

Loughborough University

5. Burrage, Alex J. Complexity measures for classes of sequences and cryptographic applications.

Degree: PhD, 2013, Loughborough University

URL: https://dspace.lboro.ac.uk/2134/11723 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.568341

► Pseudo-random sequences are a crucial component of cryptography, particularly in stream cipher design. In this thesis we will investigate several measures of *randomness* for certain…
(more)

Subjects/Keywords: 515; Sequences; Cryptography; Randomness; Complexity

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Burrage, A. J. (2013). Complexity measures for classes of sequences and cryptographic applications. (Doctoral Dissertation). Loughborough University. Retrieved from https://dspace.lboro.ac.uk/2134/11723 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.568341

Chicago Manual of Style (16^{th} Edition):

Burrage, Alex J. “Complexity measures for classes of sequences and cryptographic applications.” 2013. Doctoral Dissertation, Loughborough University. Accessed January 24, 2019. https://dspace.lboro.ac.uk/2134/11723 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.568341.

MLA Handbook (7^{th} Edition):

Burrage, Alex J. “Complexity measures for classes of sequences and cryptographic applications.” 2013. Web. 24 Jan 2019.

Vancouver:

Burrage AJ. Complexity measures for classes of sequences and cryptographic applications. [Internet] [Doctoral dissertation]. Loughborough University; 2013. [cited 2019 Jan 24]. Available from: https://dspace.lboro.ac.uk/2134/11723 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.568341.

Council of Science Editors:

Burrage AJ. Complexity measures for classes of sequences and cryptographic applications. [Doctoral Dissertation]. Loughborough University; 2013. Available from: https://dspace.lboro.ac.uk/2134/11723 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.568341

Laurentian University

6. Vares, David A. E. The central tendency relationships between earthquakes, quantum fluctuations, and the human brain .

Degree: 2014, Laurentian University

URL: https://zone.biblio.laurentian.ca/dspace/handle/10219/2253

► Physical phenomena occur within a complex manifold of interactions from small scale quantum to large scale energies. These random interactions appear to conform to the…
(more)

Subjects/Keywords: Memory; Consciousness; Quantum Randomness; Entropy

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Vares, D. A. E. (2014). The central tendency relationships between earthquakes, quantum fluctuations, and the human brain . (Thesis). Laurentian University. Retrieved from https://zone.biblio.laurentian.ca/dspace/handle/10219/2253

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Vares, David A E. “The central tendency relationships between earthquakes, quantum fluctuations, and the human brain .” 2014. Thesis, Laurentian University. Accessed January 24, 2019. https://zone.biblio.laurentian.ca/dspace/handle/10219/2253.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Vares, David A E. “The central tendency relationships between earthquakes, quantum fluctuations, and the human brain .” 2014. Web. 24 Jan 2019.

Vancouver:

Vares DAE. The central tendency relationships between earthquakes, quantum fluctuations, and the human brain . [Internet] [Thesis]. Laurentian University; 2014. [cited 2019 Jan 24]. Available from: https://zone.biblio.laurentian.ca/dspace/handle/10219/2253.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vares DAE. The central tendency relationships between earthquakes, quantum fluctuations, and the human brain . [Thesis]. Laurentian University; 2014. Available from: https://zone.biblio.laurentian.ca/dspace/handle/10219/2253

Not specified: Masters Thesis or Doctoral Dissertation

University of California – Berkeley

7. Haken, Ian Robert. Randomizing Reals and the First-Order Consequences of Randoms.

Degree: Mathematics, 2014, University of California – Berkeley

URL: http://www.escholarship.org/uc/item/1pj1b1vk

► In this dissertation we investigate two questions in the *subject* of algorithmic *randomness*. The first question we address is "Given a real, is there a…
(more)

Subjects/Keywords: Mathematics; Arithmetic; Logic; Measures; Randomness

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Haken, I. R. (2014). Randomizing Reals and the First-Order Consequences of Randoms. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/1pj1b1vk

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Haken, Ian Robert. “Randomizing Reals and the First-Order Consequences of Randoms.” 2014. Thesis, University of California – Berkeley. Accessed January 24, 2019. http://www.escholarship.org/uc/item/1pj1b1vk.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Haken, Ian Robert. “Randomizing Reals and the First-Order Consequences of Randoms.” 2014. Web. 24 Jan 2019.

Vancouver:

Haken IR. Randomizing Reals and the First-Order Consequences of Randoms. [Internet] [Thesis]. University of California – Berkeley; 2014. [cited 2019 Jan 24]. Available from: http://www.escholarship.org/uc/item/1pj1b1vk.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Haken IR. Randomizing Reals and the First-Order Consequences of Randoms. [Thesis]. University of California – Berkeley; 2014. Available from: http://www.escholarship.org/uc/item/1pj1b1vk

Not specified: Masters Thesis or Doctoral Dissertation

University of North Texas

8. He, Dayin. A Smooth-turn Mobility Model for Airborne Networks.

Degree: 2012, University of North Texas

URL: https://digital.library.unt.edu/ark:/67531/metadc149603/

► In this article, I introduce a novel airborne network mobility model, called the Smooth Turn Mobility Model, that captures the correlation of acceleration for airborne…
(more)

Subjects/Keywords: Mobility model; airborne networks; randomness

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

He, D. (2012). A Smooth-turn Mobility Model for Airborne Networks. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc149603/

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

He, Dayin. “A Smooth-turn Mobility Model for Airborne Networks.” 2012. Thesis, University of North Texas. Accessed January 24, 2019. https://digital.library.unt.edu/ark:/67531/metadc149603/.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

He, Dayin. “A Smooth-turn Mobility Model for Airborne Networks.” 2012. Web. 24 Jan 2019.

Vancouver:

He D. A Smooth-turn Mobility Model for Airborne Networks. [Internet] [Thesis]. University of North Texas; 2012. [cited 2019 Jan 24]. Available from: https://digital.library.unt.edu/ark:/67531/metadc149603/.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

He D. A Smooth-turn Mobility Model for Airborne Networks. [Thesis]. University of North Texas; 2012. Available from: https://digital.library.unt.edu/ark:/67531/metadc149603/

Not specified: Masters Thesis or Doctoral Dissertation

Cornell University

9.
Cadieu, Morgane.
English: "Random Walks: Chance, Anti-*Randomness*, And Clinamen As Literary Paradigms" French: "Marcher Au Hasard : Chance, Antihasard Et Clinamen En Tant Que Paradigmes LittéRaires"
.

Degree: 2014, Cornell University

URL: http://hdl.handle.net/1813/37103

► This dissertation challenges the critical accounts that have confined the aesthetic fertility of *randomness* to early twentieth-century literature, and notably to Mallarmé and the Surrealists.…
(more)

Subjects/Keywords: Randomness; Space Studies; Materialism

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Cadieu, M. (2014). English: "Random Walks: Chance, Anti-Randomness, And Clinamen As Literary Paradigms" French: "Marcher Au Hasard : Chance, Antihasard Et Clinamen En Tant Que Paradigmes LittéRaires" . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/37103

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Cadieu, Morgane. “English: "Random Walks: Chance, Anti-Randomness, And Clinamen As Literary Paradigms" French: "Marcher Au Hasard : Chance, Antihasard Et Clinamen En Tant Que Paradigmes LittéRaires" .” 2014. Thesis, Cornell University. Accessed January 24, 2019. http://hdl.handle.net/1813/37103.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Cadieu, Morgane. “English: "Random Walks: Chance, Anti-Randomness, And Clinamen As Literary Paradigms" French: "Marcher Au Hasard : Chance, Antihasard Et Clinamen En Tant Que Paradigmes LittéRaires" .” 2014. Web. 24 Jan 2019.

Vancouver:

Cadieu M. English: "Random Walks: Chance, Anti-Randomness, And Clinamen As Literary Paradigms" French: "Marcher Au Hasard : Chance, Antihasard Et Clinamen En Tant Que Paradigmes LittéRaires" . [Internet] [Thesis]. Cornell University; 2014. [cited 2019 Jan 24]. Available from: http://hdl.handle.net/1813/37103.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cadieu M. English: "Random Walks: Chance, Anti-Randomness, And Clinamen As Literary Paradigms" French: "Marcher Au Hasard : Chance, Antihasard Et Clinamen En Tant Que Paradigmes LittéRaires" . [Thesis]. Cornell University; 2014. Available from: http://hdl.handle.net/1813/37103

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

10.
Hurst, Ada.
A Quantitative Model of Perception of *Randomness* in Structured Space.

Degree: 2015, University of Waterloo

URL: http://hdl.handle.net/10012/10027

► The literature on the perception and generation of *randomness* suggests that people’s conception of *randomness* deviates from true *randomness* in predictable and consistent ways. In…
(more)

Subjects/Keywords: randomness; perception; subjective probability; modelling

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Hurst, A. (2015). A Quantitative Model of Perception of Randomness in Structured Space. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10027

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Hurst, Ada. “A Quantitative Model of Perception of Randomness in Structured Space.” 2015. Thesis, University of Waterloo. Accessed January 24, 2019. http://hdl.handle.net/10012/10027.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hurst, Ada. “A Quantitative Model of Perception of Randomness in Structured Space.” 2015. Web. 24 Jan 2019.

Vancouver:

Hurst A. A Quantitative Model of Perception of Randomness in Structured Space. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2019 Jan 24]. Available from: http://hdl.handle.net/10012/10027.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hurst A. A Quantitative Model of Perception of Randomness in Structured Space. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/10027

Not specified: Masters Thesis or Doctoral Dissertation

Victoria University of Wellington

11.
McInerney, Michael.
Topics in Algorithmic *Randomness* and Computability Theory.

Degree: 2016, Victoria University of Wellington

URL: http://hdl.handle.net/10063/5158

► This thesis establishes results in several different areas of computability theory. The first chapter is concerned with algorithmic *randomness*. A well-known approach to the definition…
(more)

Subjects/Keywords: Computability theory; Randomness; Forcing; Genericity

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

McInerney, M. (2016). Topics in Algorithmic Randomness and Computability Theory. (Doctoral Dissertation). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/5158

Chicago Manual of Style (16^{th} Edition):

McInerney, Michael. “Topics in Algorithmic Randomness and Computability Theory.” 2016. Doctoral Dissertation, Victoria University of Wellington. Accessed January 24, 2019. http://hdl.handle.net/10063/5158.

MLA Handbook (7^{th} Edition):

McInerney, Michael. “Topics in Algorithmic Randomness and Computability Theory.” 2016. Web. 24 Jan 2019.

Vancouver:

McInerney M. Topics in Algorithmic Randomness and Computability Theory. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 2016. [cited 2019 Jan 24]. Available from: http://hdl.handle.net/10063/5158.

Council of Science Editors:

McInerney M. Topics in Algorithmic Randomness and Computability Theory. [Doctoral Dissertation]. Victoria University of Wellington; 2016. Available from: http://hdl.handle.net/10063/5158

University of Notre Dame

12.
Christopher Porter.
Mathematical and Philosophical Perspectives on Algorithmic
*Randomness*</h1>.

Degree: PhD, Philosophy, 2012, University of Notre Dame

URL: https://curate.nd.edu/show/cv43nv9583f

► The mathematics portion of this dissertation is a study of the various interactions between definitions of algorithmic *randomness*, Turing functionals, and non-uniform probability measures…
(more)

Subjects/Keywords: algorithmic randomness; philosophy of mathematics

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Porter, C. (2012). Mathematical and Philosophical Perspectives on Algorithmic Randomness</h1>. (Doctoral Dissertation). University of Notre Dame. Retrieved from https://curate.nd.edu/show/cv43nv9583f

Chicago Manual of Style (16^{th} Edition):

Porter, Christopher. “Mathematical and Philosophical Perspectives on Algorithmic Randomness</h1>.” 2012. Doctoral Dissertation, University of Notre Dame. Accessed January 24, 2019. https://curate.nd.edu/show/cv43nv9583f.

MLA Handbook (7^{th} Edition):

Porter, Christopher. “Mathematical and Philosophical Perspectives on Algorithmic Randomness</h1>.” 2012. Web. 24 Jan 2019.

Vancouver:

Porter C. Mathematical and Philosophical Perspectives on Algorithmic Randomness</h1>. [Internet] [Doctoral dissertation]. University of Notre Dame; 2012. [cited 2019 Jan 24]. Available from: https://curate.nd.edu/show/cv43nv9583f.

Council of Science Editors:

Porter C. Mathematical and Philosophical Perspectives on Algorithmic Randomness</h1>. [Doctoral Dissertation]. University of Notre Dame; 2012. Available from: https://curate.nd.edu/show/cv43nv9583f

13.
Robson, Charlie.
Computable *Randomness*, and Coding the Orbits of the Collatz Map.

Degree: PhD, 2017, Oregon State University

URL: http://hdl.handle.net/1957/61676

► In this thesis I will look at a definition of computable *randomness* from Algorithmic Information Theory as defined by Andre Nies through the lens of…
(more)

Subjects/Keywords: Algorithmic Randomness

…COMPUTABLE *RANDOMNESS*, AND CODING THE ORBITS OF
THE COLLATZ MAP
2
1
GENERAL… …part: "Computable *Randomness* in Two Notions of Computable Reals", which I will… …refer
to as Part 1, concerns itself with the definition of computable *randomness* [1]… …*randomness*
or unpredictability of the sequence in an effective way. This is achieved through what… …class remains unchanged. This implies that one may establish computable *randomness*
using the…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Robson, C. (2017). Computable Randomness, and Coding the Orbits of the Collatz Map. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/61676

Chicago Manual of Style (16^{th} Edition):

Robson, Charlie. “Computable Randomness, and Coding the Orbits of the Collatz Map.” 2017. Doctoral Dissertation, Oregon State University. Accessed January 24, 2019. http://hdl.handle.net/1957/61676.

MLA Handbook (7^{th} Edition):

Robson, Charlie. “Computable Randomness, and Coding the Orbits of the Collatz Map.” 2017. Web. 24 Jan 2019.

Vancouver:

Robson C. Computable Randomness, and Coding the Orbits of the Collatz Map. [Internet] [Doctoral dissertation]. Oregon State University; 2017. [cited 2019 Jan 24]. Available from: http://hdl.handle.net/1957/61676.

Council of Science Editors:

Robson C. Computable Randomness, and Coding the Orbits of the Collatz Map. [Doctoral Dissertation]. Oregon State University; 2017. Available from: http://hdl.handle.net/1957/61676

University of New South Wales

14.
McDonald, Fiona Elizabeth Jean.
Understanding *randomness* via the perception and prediction of binary sequences.

Degree: Psychology, 2009, University of New South Wales

URL: http://handle.unsw.edu.au/1959.4/44992 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:8290/SOURCE02?view=true

► The thesis explored whether a common concept of *randomness* determines behaviour on two *randomness* cognition tasks; perceptions of *randomness* and predictions of future outcomes. The…
(more)

Subjects/Keywords: Gambler's fallacy; Randomness; Judgement; Causal agent

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

McDonald, F. E. J. (2009). Understanding randomness via the perception and prediction of binary sequences. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/44992 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:8290/SOURCE02?view=true

Chicago Manual of Style (16^{th} Edition):

McDonald, Fiona Elizabeth Jean. “Understanding randomness via the perception and prediction of binary sequences.” 2009. Doctoral Dissertation, University of New South Wales. Accessed January 24, 2019. http://handle.unsw.edu.au/1959.4/44992 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:8290/SOURCE02?view=true.

MLA Handbook (7^{th} Edition):

McDonald, Fiona Elizabeth Jean. “Understanding randomness via the perception and prediction of binary sequences.” 2009. Web. 24 Jan 2019.

Vancouver:

McDonald FEJ. Understanding randomness via the perception and prediction of binary sequences. [Internet] [Doctoral dissertation]. University of New South Wales; 2009. [cited 2019 Jan 24]. Available from: http://handle.unsw.edu.au/1959.4/44992 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:8290/SOURCE02?view=true.

Council of Science Editors:

McDonald FEJ. Understanding randomness via the perception and prediction of binary sequences. [Doctoral Dissertation]. University of New South Wales; 2009. Available from: http://handle.unsw.edu.au/1959.4/44992 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:8290/SOURCE02?view=true

Rochester Institute of Technology

15. Shaw, Luke. Approachi Significans.

Degree: MFA, School of Photographic Arts and Sciences (CIAS), 2013, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/943

► Approachi Significans is a demonstration of the interference patterns created by scientific and artistic logics. It promotes immersion in the everyday world through experimentation…
(more)

Subjects/Keywords: Evidence; Photography; Randomness; Science; Scientific method; Shaw

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Shaw, L. (2013). Approachi Significans. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/943

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Shaw, Luke. “Approachi Significans.” 2013. Thesis, Rochester Institute of Technology. Accessed January 24, 2019. https://scholarworks.rit.edu/theses/943.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Shaw, Luke. “Approachi Significans.” 2013. Web. 24 Jan 2019.

Vancouver:

Shaw L. Approachi Significans. [Internet] [Thesis]. Rochester Institute of Technology; 2013. [cited 2019 Jan 24]. Available from: https://scholarworks.rit.edu/theses/943.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Shaw L. Approachi Significans. [Thesis]. Rochester Institute of Technology; 2013. Available from: https://scholarworks.rit.edu/theses/943

Not specified: Masters Thesis or Doctoral Dissertation

University of California – Berkeley

16.
Allen, Kelty Ann.
Martin-Löf *Randomness* and Brownian Motion.

Degree: Logic & the Methodology of Science, 2014, University of California – Berkeley

URL: http://www.escholarship.org/uc/item/20072582

► We investigate the Martin-Lof random sample paths of Brownian motion, applying techniques from algorithmic *randomness* to Brownian motion, an active area of research in probability…
(more)

Subjects/Keywords: Logic; Mathematics; Algorithmic Randomness; Brownian Motion; Computability Theory; Computable Analysis; Martin-Löf Randomness

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Allen, K. A. (2014). Martin-Löf Randomness and Brownian Motion. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/20072582

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Allen, Kelty Ann. “Martin-Löf Randomness and Brownian Motion.” 2014. Thesis, University of California – Berkeley. Accessed January 24, 2019. http://www.escholarship.org/uc/item/20072582.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Allen, Kelty Ann. “Martin-Löf Randomness and Brownian Motion.” 2014. Web. 24 Jan 2019.

Vancouver:

Allen KA. Martin-Löf Randomness and Brownian Motion. [Internet] [Thesis]. University of California – Berkeley; 2014. [cited 2019 Jan 24]. Available from: http://www.escholarship.org/uc/item/20072582.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Allen KA. Martin-Löf Randomness and Brownian Motion. [Thesis]. University of California – Berkeley; 2014. Available from: http://www.escholarship.org/uc/item/20072582

Not specified: Masters Thesis or Doctoral Dissertation

Universidade Federal de Santa Maria

17. Vilson Benz. INDEPENDÊNCIA DAS PRODUÇÕES EM EXPERIMENTOS COM CULTURAS OLERÍCOLAS.

Degree: 2011, Universidade Federal de Santa Maria

URL: http://coralx.ufsm.br/tede/tde_busca/arquivo.php?codArquivo=4178

►

O conhecimento da variabilidade da produção entre as parcelas experimentais dentro do ambiente protegido, tanto no espaço como ao longo das diferentes colheitas, se faz… (more)

Subjects/Keywords: Cultivo protegido; Aleatoriedade; Precisão experimental; AGRONOMIA; Randomness; Protected cultivation; Experimental precision

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Benz, V. (2011). INDEPENDÊNCIA DAS PRODUÇÕES EM EXPERIMENTOS COM CULTURAS OLERÍCOLAS. (Thesis). Universidade Federal de Santa Maria. Retrieved from http://coralx.ufsm.br/tede/tde_busca/arquivo.php?codArquivo=4178

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Benz, Vilson. “INDEPENDÊNCIA DAS PRODUÇÕES EM EXPERIMENTOS COM CULTURAS OLERÍCOLAS.” 2011. Thesis, Universidade Federal de Santa Maria. Accessed January 24, 2019. http://coralx.ufsm.br/tede/tde_busca/arquivo.php?codArquivo=4178.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Benz, Vilson. “INDEPENDÊNCIA DAS PRODUÇÕES EM EXPERIMENTOS COM CULTURAS OLERÍCOLAS.” 2011. Web. 24 Jan 2019.

Vancouver:

Benz V. INDEPENDÊNCIA DAS PRODUÇÕES EM EXPERIMENTOS COM CULTURAS OLERÍCOLAS. [Internet] [Thesis]. Universidade Federal de Santa Maria; 2011. [cited 2019 Jan 24]. Available from: http://coralx.ufsm.br/tede/tde_busca/arquivo.php?codArquivo=4178.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Benz V. INDEPENDÊNCIA DAS PRODUÇÕES EM EXPERIMENTOS COM CULTURAS OLERÍCOLAS. [Thesis]. Universidade Federal de Santa Maria; 2011. Available from: http://coralx.ufsm.br/tede/tde_busca/arquivo.php?codArquivo=4178

Not specified: Masters Thesis or Doctoral Dissertation

Princeton University

18. Liu, Jingbo. Information Theory from A Functional Viewpoint .

Degree: PhD, 2018, Princeton University

URL: http://arks.princeton.edu/ark:/88435/dsp01g158bk964

► A perennial theme of information theory is to find new methods to determine the fundamental limits of various communication systems, which potentially helps the engineers…
(more)

Subjects/Keywords: common randomness; functional inequality; high dimensional; information theory; multiuser; non-asymptotic

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Liu, J. (2018). Information Theory from A Functional Viewpoint . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01g158bk964

Chicago Manual of Style (16^{th} Edition):

Liu, Jingbo. “Information Theory from A Functional Viewpoint .” 2018. Doctoral Dissertation, Princeton University. Accessed January 24, 2019. http://arks.princeton.edu/ark:/88435/dsp01g158bk964.

MLA Handbook (7^{th} Edition):

Liu, Jingbo. “Information Theory from A Functional Viewpoint .” 2018. Web. 24 Jan 2019.

Vancouver:

Liu J. Information Theory from A Functional Viewpoint . [Internet] [Doctoral dissertation]. Princeton University; 2018. [cited 2019 Jan 24]. Available from: http://arks.princeton.edu/ark:/88435/dsp01g158bk964.

Council of Science Editors:

Liu J. Information Theory from A Functional Viewpoint . [Doctoral Dissertation]. Princeton University; 2018. Available from: http://arks.princeton.edu/ark:/88435/dsp01g158bk964

University of Waterloo

19.
Ozols, Maris.
Quantum Random Access Codes with Shared * Randomness*.

Degree: 2009, University of Waterloo

URL: http://hdl.handle.net/10012/4458

► We consider a communication method, where the sender encodes n classical bits into 1 qubit and sends it to the receiver who performs a certain…
(more)

Subjects/Keywords: quantum random access codes; shared randomness; Yao's principle; Bloch sphere

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Ozols, M. (2009). Quantum Random Access Codes with Shared Randomness. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4458

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Ozols, Maris. “Quantum Random Access Codes with Shared Randomness.” 2009. Thesis, University of Waterloo. Accessed January 24, 2019. http://hdl.handle.net/10012/4458.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ozols, Maris. “Quantum Random Access Codes with Shared Randomness.” 2009. Web. 24 Jan 2019.

Vancouver:

Ozols M. Quantum Random Access Codes with Shared Randomness. [Internet] [Thesis]. University of Waterloo; 2009. [cited 2019 Jan 24]. Available from: http://hdl.handle.net/10012/4458.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ozols M. Quantum Random Access Codes with Shared Randomness. [Thesis]. University of Waterloo; 2009. Available from: http://hdl.handle.net/10012/4458

Not specified: Masters Thesis or Doctoral Dissertation

20.
Zhao, Jiaying.
* Randomness* Cognition: Linking Perception and Conception
.

Degree: PhD, 2013, Princeton University

URL: http://arks.princeton.edu/ark:/88435/dsp01mg74qm18h

► The cognition of *randomness* consists of perceptual and conceptual components. One might be able to discriminate random from non-random stimuli, yet be unable to identify…
(more)

Subjects/Keywords: perception; randomness; structure; texture

…71
viii
Chapter 1
Introduction
How people understand *randomness* has been a question of… …longstanding interest in psychology.
The ability to apprehend *randomness* is fundamental to cognition… …literature on *randomness* has predominantly focused on beliefs or
subjective intuitions about… …*randomness*. In most studies, participants are often instructed to assess
the degree of perceived… …*randomness* of a given bit string (i.e., sequence), or to produce a
sequence as if it is…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Zhao, J. (2013). Randomness Cognition: Linking Perception and Conception . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01mg74qm18h

Chicago Manual of Style (16^{th} Edition):

Zhao, Jiaying. “Randomness Cognition: Linking Perception and Conception .” 2013. Doctoral Dissertation, Princeton University. Accessed January 24, 2019. http://arks.princeton.edu/ark:/88435/dsp01mg74qm18h.

MLA Handbook (7^{th} Edition):

Zhao, Jiaying. “Randomness Cognition: Linking Perception and Conception .” 2013. Web. 24 Jan 2019.

Vancouver:

Zhao J. Randomness Cognition: Linking Perception and Conception . [Internet] [Doctoral dissertation]. Princeton University; 2013. [cited 2019 Jan 24]. Available from: http://arks.princeton.edu/ark:/88435/dsp01mg74qm18h.

Council of Science Editors:

Zhao J. Randomness Cognition: Linking Perception and Conception . [Doctoral Dissertation]. Princeton University; 2013. Available from: http://arks.princeton.edu/ark:/88435/dsp01mg74qm18h

University of Texas – Austin

21. Li, Xin, Ph. D. Distributed computing and cryptography with general weak random sources.

Degree: Computer Sciences, 2011, University of Texas – Austin

URL: http://hdl.handle.net/2152/30361

► The use of *randomness* in computer science is ubiquitous. Randomized protocols have turned out to be much more efficient than their deterministic counterparts. In addition,…
(more)

Subjects/Keywords: Randomness; Weak random source; Extractor; Distributed computing; Cryptography

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Li, Xin, P. D. (2011). Distributed computing and cryptography with general weak random sources. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/30361

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Li, Xin, Ph D. “Distributed computing and cryptography with general weak random sources.” 2011. Thesis, University of Texas – Austin. Accessed January 24, 2019. http://hdl.handle.net/2152/30361.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Li, Xin, Ph D. “Distributed computing and cryptography with general weak random sources.” 2011. Web. 24 Jan 2019.

Vancouver:

Li, Xin PD. Distributed computing and cryptography with general weak random sources. [Internet] [Thesis]. University of Texas – Austin; 2011. [cited 2019 Jan 24]. Available from: http://hdl.handle.net/2152/30361.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Li, Xin PD. Distributed computing and cryptography with general weak random sources. [Thesis]. University of Texas – Austin; 2011. Available from: http://hdl.handle.net/2152/30361

Not specified: Masters Thesis or Doctoral Dissertation

Iowa State University

22.
Case, Adam.
Mutual dimension, data processing inequalities, and * randomness*.

Degree: 2016, Iowa State University

URL: https://lib.dr.iastate.edu/etd/15674

► This dissertation makes progress in the area of constructive dimension, an effectivization of classical Hausdorff dimension. Using constructive dimension, one may assign a non-zero number…
(more)

Subjects/Keywords: algorithmic information; data processing inequality; dimension; randomness; Computer Sciences

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Case, A. (2016). Mutual dimension, data processing inequalities, and randomness. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/15674

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Case, Adam. “Mutual dimension, data processing inequalities, and randomness.” 2016. Thesis, Iowa State University. Accessed January 24, 2019. https://lib.dr.iastate.edu/etd/15674.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Case, Adam. “Mutual dimension, data processing inequalities, and randomness.” 2016. Web. 24 Jan 2019.

Vancouver:

Case A. Mutual dimension, data processing inequalities, and randomness. [Internet] [Thesis]. Iowa State University; 2016. [cited 2019 Jan 24]. Available from: https://lib.dr.iastate.edu/etd/15674.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Case A. Mutual dimension, data processing inequalities, and randomness. [Thesis]. Iowa State University; 2016. Available from: https://lib.dr.iastate.edu/etd/15674

Not specified: Masters Thesis or Doctoral Dissertation

University College London (University of London)

23. Pratt, David Charles. The construction of meanings in and for : a stochastic domain of abstraction.

Degree: PhD, 1998, University College London (University of London)

URL: http://discovery.ucl.ac.uk/10006602/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.286375

► This study takes as its focus young children's intuitive knowledge of *randomness*. Previous work in this field has studied the misconceptions that people, especially adults,…
(more)

Subjects/Keywords: 370; Children; Intuitive knowledge; Randomness

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Pratt, D. C. (1998). The construction of meanings in and for : a stochastic domain of abstraction. (Doctoral Dissertation). University College London (University of London). Retrieved from http://discovery.ucl.ac.uk/10006602/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.286375

Chicago Manual of Style (16^{th} Edition):

Pratt, David Charles. “The construction of meanings in and for : a stochastic domain of abstraction.” 1998. Doctoral Dissertation, University College London (University of London). Accessed January 24, 2019. http://discovery.ucl.ac.uk/10006602/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.286375.

MLA Handbook (7^{th} Edition):

Pratt, David Charles. “The construction of meanings in and for : a stochastic domain of abstraction.” 1998. Web. 24 Jan 2019.

Vancouver:

Pratt DC. The construction of meanings in and for : a stochastic domain of abstraction. [Internet] [Doctoral dissertation]. University College London (University of London); 1998. [cited 2019 Jan 24]. Available from: http://discovery.ucl.ac.uk/10006602/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.286375.

Council of Science Editors:

Pratt DC. The construction of meanings in and for : a stochastic domain of abstraction. [Doctoral Dissertation]. University College London (University of London); 1998. Available from: http://discovery.ucl.ac.uk/10006602/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.286375

Penn State University

24.
Pardo, John.
* Randomness* of Restricted Value Martingales, Selection Rules, and Graph Sequences.

Degree: 2017, Penn State University

URL: https://etda.libraries.psu.edu/catalog/13948jjp307

► In this dissertation we consider the classical notions of stochasticity and *randomness* as they pertain to several areas of mathematics. We look at three main…
(more)

Subjects/Keywords: Randomness; Selection Rules; Restricted Value Martingales; Normality; Graphs

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Pardo, J. (2017). Randomness of Restricted Value Martingales, Selection Rules, and Graph Sequences. (Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/13948jjp307

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Pardo, John. “Randomness of Restricted Value Martingales, Selection Rules, and Graph Sequences.” 2017. Thesis, Penn State University. Accessed January 24, 2019. https://etda.libraries.psu.edu/catalog/13948jjp307.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Pardo, John. “Randomness of Restricted Value Martingales, Selection Rules, and Graph Sequences.” 2017. Web. 24 Jan 2019.

Vancouver:

Pardo J. Randomness of Restricted Value Martingales, Selection Rules, and Graph Sequences. [Internet] [Thesis]. Penn State University; 2017. [cited 2019 Jan 24]. Available from: https://etda.libraries.psu.edu/catalog/13948jjp307.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pardo J. Randomness of Restricted Value Martingales, Selection Rules, and Graph Sequences. [Thesis]. Penn State University; 2017. Available from: https://etda.libraries.psu.edu/catalog/13948jjp307

Not specified: Masters Thesis or Doctoral Dissertation

University of Notre Dame

25. Cheng Wang. Three Essays on Triadic Evolution in a Large-scale Mobile Phone Network</h1>.

Degree: PhD, Sociology, 2012, University of Notre Dame

URL: https://curate.nd.edu/show/v979v12182w

► This dissertation consists of three independent but related essays that explore different aspects of triadic evolution in a large-scale mobile phone network. The first…
(more)

Subjects/Keywords: clustered random graph; randomness and robustness; triadic evolution; triangle preservation effect

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Wang, C. (2012). Three Essays on Triadic Evolution in a Large-scale Mobile Phone Network</h1>. (Doctoral Dissertation). University of Notre Dame. Retrieved from https://curate.nd.edu/show/v979v12182w

Chicago Manual of Style (16^{th} Edition):

Wang, Cheng. “Three Essays on Triadic Evolution in a Large-scale Mobile Phone Network</h1>.” 2012. Doctoral Dissertation, University of Notre Dame. Accessed January 24, 2019. https://curate.nd.edu/show/v979v12182w.

MLA Handbook (7^{th} Edition):

Wang, Cheng. “Three Essays on Triadic Evolution in a Large-scale Mobile Phone Network</h1>.” 2012. Web. 24 Jan 2019.

Vancouver:

Wang C. Three Essays on Triadic Evolution in a Large-scale Mobile Phone Network</h1>. [Internet] [Doctoral dissertation]. University of Notre Dame; 2012. [cited 2019 Jan 24]. Available from: https://curate.nd.edu/show/v979v12182w.

Council of Science Editors:

Wang C. Three Essays on Triadic Evolution in a Large-scale Mobile Phone Network</h1>. [Doctoral Dissertation]. University of Notre Dame; 2012. Available from: https://curate.nd.edu/show/v979v12182w

University of Florida

26. Toska, Ferit. Effective Symbolic Dynamics and Complexity.

Degree: PhD, Mathematics, 2013, University of Florida

URL: http://ufdc.ufl.edu/UFE0045340

► In the second chapter we investigate the computability of countable subshifts in one dimension, and their members. Subshifts of Cantor-Bendixson rank two contain only eventually…
(more)

Subjects/Keywords: Compressibility; Computability; Degree of unsolvability; Dynamical systems; Hausdorff dimensions; Homeomorphism; Mathematical sequences; Mathematics; Randomness; Recursion theory; complexity – computability – dynamics – machine – process – randomness – strict

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Toska, F. (2013). Effective Symbolic Dynamics and Complexity. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0045340

Chicago Manual of Style (16^{th} Edition):

Toska, Ferit. “Effective Symbolic Dynamics and Complexity.” 2013. Doctoral Dissertation, University of Florida. Accessed January 24, 2019. http://ufdc.ufl.edu/UFE0045340.

MLA Handbook (7^{th} Edition):

Toska, Ferit. “Effective Symbolic Dynamics and Complexity.” 2013. Web. 24 Jan 2019.

Vancouver:

Toska F. Effective Symbolic Dynamics and Complexity. [Internet] [Doctoral dissertation]. University of Florida; 2013. [cited 2019 Jan 24]. Available from: http://ufdc.ufl.edu/UFE0045340.

Council of Science Editors:

Toska F. Effective Symbolic Dynamics and Complexity. [Doctoral Dissertation]. University of Florida; 2013. Available from: http://ufdc.ufl.edu/UFE0045340

University of Victoria

27. Acharya, Smarak. Cellular automata pseudorandom sequence generation.

Degree: Department of Electrical and Computer Engineering, 2017, University of Victoria

URL: https://dspace.library.uvic.ca//handle/1828/8455

► Pseudorandom sequences have many applications in fields such as wireless communication, cryptography and built-in self test of integrated circuits. Maximal length sequences (m-sequences) are commonly…
(more)

Subjects/Keywords: Cellular Automata; Pseudorandom; m-sequence; Linear Complexity; Randomness; Balance; Run; Autocorrelation; 1D CA Evaluation System

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Acharya, S. (2017). Cellular automata pseudorandom sequence generation. (Masters Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/8455

Chicago Manual of Style (16^{th} Edition):

Acharya, Smarak. “Cellular automata pseudorandom sequence generation.” 2017. Masters Thesis, University of Victoria. Accessed January 24, 2019. https://dspace.library.uvic.ca//handle/1828/8455.

MLA Handbook (7^{th} Edition):

Acharya, Smarak. “Cellular automata pseudorandom sequence generation.” 2017. Web. 24 Jan 2019.

Vancouver:

Acharya S. Cellular automata pseudorandom sequence generation. [Internet] [Masters thesis]. University of Victoria; 2017. [cited 2019 Jan 24]. Available from: https://dspace.library.uvic.ca//handle/1828/8455.

Council of Science Editors:

Acharya S. Cellular automata pseudorandom sequence generation. [Masters Thesis]. University of Victoria; 2017. Available from: https://dspace.library.uvic.ca//handle/1828/8455

28. Barbosa Berrio , Nicolas. Quantum Random Number Generators using photons .

Degree: 2014, Universidad de los Andes

► La aleatoriedad cuántica nos da la certeza de que los resultados obtenidos sean aleatorios verdaderamente. No dependen de ninguna otra fuente, de manera que no…
(more)

Subjects/Keywords: Quantum; Optics; Randomness; Aleatoriedad; Óptica; Cuántica

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Barbosa Berrio , N. (2014). Quantum Random Number Generators using photons . (Thesis). Universidad de los Andes. Retrieved from http://documentodegrado.uniandes.edu.co/documentos/200911134_fecha_2014_01_23_hora_21_09_10_parte_1.pdf

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Barbosa Berrio , Nicolas. “Quantum Random Number Generators using photons .” 2014. Thesis, Universidad de los Andes. Accessed January 24, 2019. http://documentodegrado.uniandes.edu.co/documentos/200911134_fecha_2014_01_23_hora_21_09_10_parte_1.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Barbosa Berrio , Nicolas. “Quantum Random Number Generators using photons .” 2014. Web. 24 Jan 2019.

Vancouver:

Barbosa Berrio N. Quantum Random Number Generators using photons . [Internet] [Thesis]. Universidad de los Andes; 2014. [cited 2019 Jan 24]. Available from: http://documentodegrado.uniandes.edu.co/documentos/200911134_fecha_2014_01_23_hora_21_09_10_parte_1.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Barbosa Berrio N. Quantum Random Number Generators using photons . [Thesis]. Universidad de los Andes; 2014. Available from: http://documentodegrado.uniandes.edu.co/documentos/200911134_fecha_2014_01_23_hora_21_09_10_parte_1.pdf

Not specified: Masters Thesis or Doctoral Dissertation

29.
Watson, Thomas Weir.
The Computational Complexity of * Randomness*.

Degree: Computer Science, 2013, University of California – Berkeley

URL: http://www.escholarship.org/uc/item/1h14f5bg

► This dissertation explores the multifaceted interplay between efficient computation and probability distributions. We organize the aspects of this interplay according to whether the *randomness* occurs…
(more)

Subjects/Keywords: Computer science; Computational Complexity; Randomness

…computational complexity of *randomness*,” we begin
with a discussion of the terms computational… …complexity and *randomness*.
1.1
Computational Complexity
Computational complexity theory is often… …in terms of how efficiently they can be solved.
1.2
*Randomness*
The meaning of the term… …*randomness*” is a matter of philosophical debate, but it is generally
understood to involve… …uncertainty or unpredictability. For our purposes, *randomness* is
described using the mathematical…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Watson, T. W. (2013). The Computational Complexity of Randomness. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/1h14f5bg

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Watson, Thomas Weir. “The Computational Complexity of Randomness.” 2013. Thesis, University of California – Berkeley. Accessed January 24, 2019. http://www.escholarship.org/uc/item/1h14f5bg.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Watson, Thomas Weir. “The Computational Complexity of Randomness.” 2013. Web. 24 Jan 2019.

Vancouver:

Watson TW. The Computational Complexity of Randomness. [Internet] [Thesis]. University of California – Berkeley; 2013. [cited 2019 Jan 24]. Available from: http://www.escholarship.org/uc/item/1h14f5bg.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Watson TW. The Computational Complexity of Randomness. [Thesis]. University of California – Berkeley; 2013. Available from: http://www.escholarship.org/uc/item/1h14f5bg

Not specified: Masters Thesis or Doctoral Dissertation

University of Washington

30.
Hubert-Wallander, Bjorn.
Effective perceptual and cognitive functioning in a noisy world: Computing summaries and identifying * randomness*.

Degree: PhD, 2016, University of Washington

URL: http://hdl.handle.net/1773/35307

► The world around us contains a vast amount of information, but this information is contaminated by a similarly vast amount of noise. It is the…
(more)

Subjects/Keywords: probability; randomness; summary statistics; visual cognition; visual integration; Psychology; Cognitive psychology; Neurosciences; psychology

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Hubert-Wallander, B. (2016). Effective perceptual and cognitive functioning in a noisy world: Computing summaries and identifying randomness. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/35307

Chicago Manual of Style (16^{th} Edition):

Hubert-Wallander, Bjorn. “Effective perceptual and cognitive functioning in a noisy world: Computing summaries and identifying randomness.” 2016. Doctoral Dissertation, University of Washington. Accessed January 24, 2019. http://hdl.handle.net/1773/35307.

MLA Handbook (7^{th} Edition):

Hubert-Wallander, Bjorn. “Effective perceptual and cognitive functioning in a noisy world: Computing summaries and identifying randomness.” 2016. Web. 24 Jan 2019.

Vancouver:

Hubert-Wallander B. Effective perceptual and cognitive functioning in a noisy world: Computing summaries and identifying randomness. [Internet] [Doctoral dissertation]. University of Washington; 2016. [cited 2019 Jan 24]. Available from: http://hdl.handle.net/1773/35307.

Council of Science Editors:

Hubert-Wallander B. Effective perceptual and cognitive functioning in a noisy world: Computing summaries and identifying randomness. [Doctoral Dissertation]. University of Washington; 2016. Available from: http://hdl.handle.net/1773/35307