Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(computability theory). Showing records 1 – 30 of 35 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


McMaster University

1. Armstrong, Mark. Notions of Semicomputability in Topological Algebras over the Reals.

Degree: MCS, 2015, McMaster University

Several results from classical computability theory (computability over discrete structures such as the natural numbers and strings over finite alphabets, due to Turing, Church, Kleene… (more)

Subjects/Keywords: Generalised computability theory; Computability theory; Computability on the reals

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Armstrong, M. (2015). Notions of Semicomputability in Topological Algebras over the Reals. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/18334

Chicago Manual of Style (16th Edition):

Armstrong, Mark. “Notions of Semicomputability in Topological Algebras over the Reals.” 2015. Masters Thesis, McMaster University. Accessed September 26, 2020. http://hdl.handle.net/11375/18334.

MLA Handbook (7th Edition):

Armstrong, Mark. “Notions of Semicomputability in Topological Algebras over the Reals.” 2015. Web. 26 Sep 2020.

Vancouver:

Armstrong M. Notions of Semicomputability in Topological Algebras over the Reals. [Internet] [Masters thesis]. McMaster University; 2015. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/11375/18334.

Council of Science Editors:

Armstrong M. Notions of Semicomputability in Topological Algebras over the Reals. [Masters Thesis]. McMaster University; 2015. Available from: http://hdl.handle.net/11375/18334


Victoria University of Wellington

2. McInerney, Michael. Topics in Algorithmic Randomness and Computability Theory.

Degree: 2016, Victoria University of Wellington

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

McInerney, Michael. “Topics in Algorithmic Randomness and Computability Theory.” 2016. Web. 26 Sep 2020.

Vancouver:

McInerney M. Topics in Algorithmic Randomness and Computability Theory. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 2016. [cited 2020 Sep 26]. 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 California – Berkeley

3. Schweber, Noah. Interactions between computability theory and set theory.

Degree: Mathematics, 2016, University of California – Berkeley

 In this thesis, we explore connections between computability theory and set theory. We investigate an extension of reverse mathematics to a higher-order context, focusing in… (more)

Subjects/Keywords: Logic; computability-theory; forcing; set-theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schweber, N. (2016). Interactions between computability theory and set theory. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/5hn678b1

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Schweber, Noah. “Interactions between computability theory and set theory.” 2016. Thesis, University of California – Berkeley. Accessed September 26, 2020. http://www.escholarship.org/uc/item/5hn678b1.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Schweber, Noah. “Interactions between computability theory and set theory.” 2016. Web. 26 Sep 2020.

Vancouver:

Schweber N. Interactions between computability theory and set theory. [Internet] [Thesis]. University of California – Berkeley; 2016. [cited 2020 Sep 26]. Available from: http://www.escholarship.org/uc/item/5hn678b1.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Schweber N. Interactions between computability theory and set theory. [Thesis]. University of California – Berkeley; 2016. Available from: http://www.escholarship.org/uc/item/5hn678b1

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Melbourne

4. Chiodo, Maurice Charles. Conditional decision problems in group theory.

Degree: 2011, University of Melbourne

 It is well known that the triviality problem for finitely presented groups is unsolvable; we ask the question of whether there exists a general procedure… (more)

Subjects/Keywords: decision problems; group theory; computability theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chiodo, M. C. (2011). Conditional decision problems in group theory. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/37170

Chicago Manual of Style (16th Edition):

Chiodo, Maurice Charles. “Conditional decision problems in group theory.” 2011. Doctoral Dissertation, University of Melbourne. Accessed September 26, 2020. http://hdl.handle.net/11343/37170.

MLA Handbook (7th Edition):

Chiodo, Maurice Charles. “Conditional decision problems in group theory.” 2011. Web. 26 Sep 2020.

Vancouver:

Chiodo MC. Conditional decision problems in group theory. [Internet] [Doctoral dissertation]. University of Melbourne; 2011. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/11343/37170.

Council of Science Editors:

Chiodo MC. Conditional decision problems in group theory. [Doctoral Dissertation]. University of Melbourne; 2011. Available from: http://hdl.handle.net/11343/37170


University of California – Berkeley

5. Igusa, Gregory. Generic Reduction, and Work with Partial Computations and Partial Oracles.

Degree: Mathematics, 2013, University of California – Berkeley

 A generic computation of a subset A of the natural numbers consists of a computation which correctly computes most of the bits of A and… (more)

Subjects/Keywords: Mathematics; Computability; Generic Computation; Recursion Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Igusa, G. (2013). Generic Reduction, and Work with Partial Computations and Partial Oracles. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/68n499zk

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Igusa, Gregory. “Generic Reduction, and Work with Partial Computations and Partial Oracles.” 2013. Thesis, University of California – Berkeley. Accessed September 26, 2020. http://www.escholarship.org/uc/item/68n499zk.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Igusa, Gregory. “Generic Reduction, and Work with Partial Computations and Partial Oracles.” 2013. Web. 26 Sep 2020.

Vancouver:

Igusa G. Generic Reduction, and Work with Partial Computations and Partial Oracles. [Internet] [Thesis]. University of California – Berkeley; 2013. [cited 2020 Sep 26]. Available from: http://www.escholarship.org/uc/item/68n499zk.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Igusa G. Generic Reduction, and Work with Partial Computations and Partial Oracles. [Thesis]. University of California – Berkeley; 2013. Available from: http://www.escholarship.org/uc/item/68n499zk

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Penn State University

6. Hudelson, William. Partial randomness and Kolmogorov complexity.

Degree: 2013, Penn State University

 Algorithmic randomness and Kolmogorov complexity provide a computational framework for the study of probability theory and information theory. In this dissertation we prove the following… (more)

Subjects/Keywords: randomness; algorithmic randomness; complexity; Kolmogorov complexity; computability; recursion theory; mathematical logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hudelson, W. (2013). Partial randomness and Kolmogorov complexity. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/17456

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hudelson, William. “Partial randomness and Kolmogorov complexity.” 2013. Thesis, Penn State University. Accessed September 26, 2020. https://submit-etda.libraries.psu.edu/catalog/17456.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hudelson, William. “Partial randomness and Kolmogorov complexity.” 2013. Web. 26 Sep 2020.

Vancouver:

Hudelson W. Partial randomness and Kolmogorov complexity. [Internet] [Thesis]. Penn State University; 2013. [cited 2020 Sep 26]. Available from: https://submit-etda.libraries.psu.edu/catalog/17456.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hudelson W. Partial randomness and Kolmogorov complexity. [Thesis]. Penn State University; 2013. Available from: https://submit-etda.libraries.psu.edu/catalog/17456

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Penn State University

7. Maler, Adrian. Effective Theory of Levy and Feller Processes.

Degree: 2015, Penn State University

 We develop a computational framework for the study of continuous-time stochastic processes with cadlag sample paths, then effectivize important results from the classical theory of… (more)

Subjects/Keywords: logic; computability; computable analysis; Levy processes; computable measure theory; stochastic processes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maler, A. (2015). Effective Theory of Levy and Feller Processes. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/27430

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Maler, Adrian. “Effective Theory of Levy and Feller Processes.” 2015. Thesis, Penn State University. Accessed September 26, 2020. https://submit-etda.libraries.psu.edu/catalog/27430.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Maler, Adrian. “Effective Theory of Levy and Feller Processes.” 2015. Web. 26 Sep 2020.

Vancouver:

Maler A. Effective Theory of Levy and Feller Processes. [Internet] [Thesis]. Penn State University; 2015. [cited 2020 Sep 26]. Available from: https://submit-etda.libraries.psu.edu/catalog/27430.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Maler A. Effective Theory of Levy and Feller Processes. [Thesis]. Penn State University; 2015. Available from: https://submit-etda.libraries.psu.edu/catalog/27430

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

8. Adams, Francis S. Anticliques in Borel Graphs on Polish Spaces and Computable Ultrahomogeneous Structures.

Degree: PhD, Mathematics, 2017, University of Florida

Subjects/Keywords: computability; set-theory

…CHAPTER 1 INTRODUCTION: SET THEORY The first part of this thesis concerns forcing posets… …introductions to each relevant area of set theory. 1.1 Descriptive Set Theory Descriptive set theory… …iff A is Gδ . 1.2 Infinite Graph Theory and Descriptive Graph Combinatorics We use [… …12] as a standard reference for graph theory and the survey [22] as a source… …for the graph theory of definable graphs on Polish spaces. A directed graph (digraph… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Adams, F. S. (2017). Anticliques in Borel Graphs on Polish Spaces and Computable Ultrahomogeneous Structures. (Doctoral Dissertation). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0050957

Chicago Manual of Style (16th Edition):

Adams, Francis S. “Anticliques in Borel Graphs on Polish Spaces and Computable Ultrahomogeneous Structures.” 2017. Doctoral Dissertation, University of Florida. Accessed September 26, 2020. https://ufdc.ufl.edu/UFE0050957.

MLA Handbook (7th Edition):

Adams, Francis S. “Anticliques in Borel Graphs on Polish Spaces and Computable Ultrahomogeneous Structures.” 2017. Web. 26 Sep 2020.

Vancouver:

Adams FS. Anticliques in Borel Graphs on Polish Spaces and Computable Ultrahomogeneous Structures. [Internet] [Doctoral dissertation]. University of Florida; 2017. [cited 2020 Sep 26]. Available from: https://ufdc.ufl.edu/UFE0050957.

Council of Science Editors:

Adams FS. Anticliques in Borel Graphs on Polish Spaces and Computable Ultrahomogeneous Structures. [Doctoral Dissertation]. University of Florida; 2017. Available from: https://ufdc.ufl.edu/UFE0050957


University of Notre Dame

9. Stephen Flood. Paths, trees, and the computational strength of some Ramsey-type theorems.</h1>.

Degree: Mathematics, 2012, University of Notre Dame

  An industry has arisen dedicated to the study of the interplay between combinatorial principles and computational strength. In particular, much work has been done… (more)

Subjects/Keywords: reverse mathematics; combinatorics; computability theory; foundations of mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Flood, S. (2012). Paths, trees, and the computational strength of some Ramsey-type theorems.</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/7p88cf97j2w

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Flood, Stephen. “Paths, trees, and the computational strength of some Ramsey-type theorems.</h1>.” 2012. Thesis, University of Notre Dame. Accessed September 26, 2020. https://curate.nd.edu/show/7p88cf97j2w.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Flood, Stephen. “Paths, trees, and the computational strength of some Ramsey-type theorems.</h1>.” 2012. Web. 26 Sep 2020.

Vancouver:

Flood S. Paths, trees, and the computational strength of some Ramsey-type theorems.</h1>. [Internet] [Thesis]. University of Notre Dame; 2012. [cited 2020 Sep 26]. Available from: https://curate.nd.edu/show/7p88cf97j2w.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Flood S. Paths, trees, and the computational strength of some Ramsey-type theorems.</h1>. [Thesis]. University of Notre Dame; 2012. Available from: https://curate.nd.edu/show/7p88cf97j2w

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Boise State University

10. Krakoff, Marcello Gianni. Computable Reducibility of Equivalence Relations.

Degree: 2019, Boise State University

 Computable reducibility of equivalence relations is a tool to compare the complexity of equivalence relations on natural numbers. Its use is important to those doing… (more)

Subjects/Keywords: computability theory; descriptive set theory; equivalence relations; Borel equivalence relations; Logic and Foundations; Set Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Krakoff, M. G. (2019). Computable Reducibility of Equivalence Relations. (Thesis). Boise State University. Retrieved from https://scholarworks.boisestate.edu/td/1536

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Krakoff, Marcello Gianni. “Computable Reducibility of Equivalence Relations.” 2019. Thesis, Boise State University. Accessed September 26, 2020. https://scholarworks.boisestate.edu/td/1536.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Krakoff, Marcello Gianni. “Computable Reducibility of Equivalence Relations.” 2019. Web. 26 Sep 2020.

Vancouver:

Krakoff MG. Computable Reducibility of Equivalence Relations. [Internet] [Thesis]. Boise State University; 2019. [cited 2020 Sep 26]. Available from: https://scholarworks.boisestate.edu/td/1536.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Krakoff MG. Computable Reducibility of Equivalence Relations. [Thesis]. Boise State University; 2019. Available from: https://scholarworks.boisestate.edu/td/1536

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of California – Berkeley

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

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Allen, Kelty Ann. “Martin-Löf Randomness and Brownian Motion.” 2014. Web. 26 Sep 2020.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Notre Dame

12. Victor A Ocasio. Computability in the class of Real Closed Fields</h1>.

Degree: Mathematics, 2014, University of Notre Dame

  The class of Real Closed Fields (RCF) has nice model theoretic properties, among them O-minimality and quantifier elimination. We examine RCF and the non-elementary… (more)

Subjects/Keywords: Linear Orders; Turing computable embeddings; Logic; Computability; Computable structure theory; Real Closed Fields

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ocasio, V. A. (2014). Computability in the class of Real Closed Fields</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/v979v12176z

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ocasio, Victor A. “Computability in the class of Real Closed Fields</h1>.” 2014. Thesis, University of Notre Dame. Accessed September 26, 2020. https://curate.nd.edu/show/v979v12176z.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ocasio, Victor A. “Computability in the class of Real Closed Fields</h1>.” 2014. Web. 26 Sep 2020.

Vancouver:

Ocasio VA. Computability in the class of Real Closed Fields</h1>. [Internet] [Thesis]. University of Notre Dame; 2014. [cited 2020 Sep 26]. Available from: https://curate.nd.edu/show/v979v12176z.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ocasio VA. Computability in the class of Real Closed Fields</h1>. [Thesis]. University of Notre Dame; 2014. Available from: https://curate.nd.edu/show/v979v12176z

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

13. Loo, Clinton. Settling Time Reducibility Orderings.

Degree: 2010, University of Waterloo

 It is known that orderings can be formed with settling time domination and strong settling time domination as relations on c.e. sets. However, it has… (more)

Subjects/Keywords: computability theory; settling time; computation time

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Loo, C. (2010). Settling Time Reducibility Orderings. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5101

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Loo, Clinton. “Settling Time Reducibility Orderings.” 2010. Thesis, University of Waterloo. Accessed September 26, 2020. http://hdl.handle.net/10012/5101.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Loo, Clinton. “Settling Time Reducibility Orderings.” 2010. Web. 26 Sep 2020.

Vancouver:

Loo C. Settling Time Reducibility Orderings. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/10012/5101.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Loo C. Settling Time Reducibility Orderings. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5101

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Florida

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

Degree: PhD, Mathematics, 2013, University of Florida

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Chicago Manual of Style (16th Edition):

Toska, Ferit. “Effective Symbolic Dynamics and Complexity.” 2013. Doctoral Dissertation, University of Florida. Accessed September 26, 2020. https://ufdc.ufl.edu/UFE0045340.

MLA Handbook (7th Edition):

Toska, Ferit. “Effective Symbolic Dynamics and Complexity.” 2013. Web. 26 Sep 2020.

Vancouver:

Toska F. Effective Symbolic Dynamics and Complexity. [Internet] [Doctoral dissertation]. University of Florida; 2013. [cited 2020 Sep 26]. Available from: https://ufdc.ufl.edu/UFE0045340.

Council of Science Editors:

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

15. Belanger, David. Sets, Models, And Proofs: Topics In The Theory Of Recursive Functions.

Degree: PhD, Mathematics, 2015, Cornell University

 SETS, MODELS, AND PROOFS: TOPICS IN THE THEORY OF RECURSIVE FUNCTIONS David Roger Belanger, Ph.D. Cornell University We prove results in various areas of recursion… (more)

Subjects/Keywords: recursion theory; computability theory; reverse mathematics

…47 CHAPTER 0 GLOBAL INTRODUCTION In the course of developing a mathematical theory, it is… …definition in its proper context. Recursion theory is the area of mathematical logic that studies… …the last of these—the effective computability of sets—and related questions of effective… …enumerability and relative computability. Following the publication of Turing’s 1936 article [70… …and to many more besides—but also on computability in the abstract, such as the theorem of… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Belanger, D. (2015). Sets, Models, And Proofs: Topics In The Theory Of Recursive Functions. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/40909

Chicago Manual of Style (16th Edition):

Belanger, David. “Sets, Models, And Proofs: Topics In The Theory Of Recursive Functions.” 2015. Doctoral Dissertation, Cornell University. Accessed September 26, 2020. http://hdl.handle.net/1813/40909.

MLA Handbook (7th Edition):

Belanger, David. “Sets, Models, And Proofs: Topics In The Theory Of Recursive Functions.” 2015. Web. 26 Sep 2020.

Vancouver:

Belanger D. Sets, Models, And Proofs: Topics In The Theory Of Recursive Functions. [Internet] [Doctoral dissertation]. Cornell University; 2015. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/1813/40909.

Council of Science Editors:

Belanger D. Sets, Models, And Proofs: Topics In The Theory Of Recursive Functions. [Doctoral Dissertation]. Cornell University; 2015. Available from: http://hdl.handle.net/1813/40909


Iowa State University

16. Brown, Tyler Anthony. Computable structure theory on Banach spaces.

Degree: 2019, Iowa State University

 In this dissertation we investigate computability notions on several different Banach spaces, namely the separable Lp-spaces and C[0,1]. It was demonstrated by McNicholl that the… (more)

Subjects/Keywords: Banach space; computability theory; computable; Continuous function; Lp space; structure theory; Computer Sciences; Logic and Foundations of Mathematics; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brown, T. A. (2019). Computable structure theory on Banach spaces. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/17412

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Brown, Tyler Anthony. “Computable structure theory on Banach spaces.” 2019. Thesis, Iowa State University. Accessed September 26, 2020. https://lib.dr.iastate.edu/etd/17412.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Brown, Tyler Anthony. “Computable structure theory on Banach spaces.” 2019. Web. 26 Sep 2020.

Vancouver:

Brown TA. Computable structure theory on Banach spaces. [Internet] [Thesis]. Iowa State University; 2019. [cited 2020 Sep 26]. Available from: https://lib.dr.iastate.edu/etd/17412.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Brown TA. Computable structure theory on Banach spaces. [Thesis]. Iowa State University; 2019. Available from: https://lib.dr.iastate.edu/etd/17412

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Notre Dame

17. Sara B. Quinn. Algorithmic Complexity of Algebraic Structures</h1>.

Degree: Mathematics, 2008, University of Notre Dame

  In mathematics, one often tries to classify some collection of objects up to isomorphism. In mathematical logic, we can explore the complexity of that… (more)

Subjects/Keywords: algebraic structures; computable structure theory; computability theory; mathematical logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Quinn, S. B. (2008). Algorithmic Complexity of Algebraic Structures</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/xd07gq7038v

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Quinn, Sara B.. “Algorithmic Complexity of Algebraic Structures</h1>.” 2008. Thesis, University of Notre Dame. Accessed September 26, 2020. https://curate.nd.edu/show/xd07gq7038v.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Quinn, Sara B.. “Algorithmic Complexity of Algebraic Structures</h1>.” 2008. Web. 26 Sep 2020.

Vancouver:

Quinn SB. Algorithmic Complexity of Algebraic Structures</h1>. [Internet] [Thesis]. University of Notre Dame; 2008. [cited 2020 Sep 26]. Available from: https://curate.nd.edu/show/xd07gq7038v.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Quinn SB. Algorithmic Complexity of Algebraic Structures</h1>. [Thesis]. University of Notre Dame; 2008. Available from: https://curate.nd.edu/show/xd07gq7038v

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

18. Deveau, Michael. Computability Theory and Some Applications.

Degree: 2019, University of Waterloo

 We explore various areas of computability theory, ranging from applications in computable structure theory primarily focused on problems about computing isomorphisms, to a number of… (more)

Subjects/Keywords: computability theory; recursion theory; computable structure theory; computable group theory; bounded jump; weak truth table reduction; bounded Turing reduction; degree of categoricity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Deveau, M. (2019). Computability Theory and Some Applications. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14800

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Deveau, Michael. “Computability Theory and Some Applications.” 2019. Thesis, University of Waterloo. Accessed September 26, 2020. http://hdl.handle.net/10012/14800.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Deveau, Michael. “Computability Theory and Some Applications.” 2019. Web. 26 Sep 2020.

Vancouver:

Deveau M. Computability Theory and Some Applications. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/10012/14800.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Deveau M. Computability Theory and Some Applications. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14800

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Indiana University

19. Teutsch, Jason Richmond. Noncomputable Spectral Sets .

Degree: 2010, Indiana University

 It is a basic fact that, given a computer language and a computable integer function, there exists a shortest program in that language which computes… (more)

Subjects/Keywords: computability theory; minimal indices; shortest programs; Godel numberings; Turing degrees; immunity; Kolmogorov complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Teutsch, J. R. (2010). Noncomputable Spectral Sets . (Thesis). Indiana University. Retrieved from http://hdl.handle.net/2022/7345

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Teutsch, Jason Richmond. “Noncomputable Spectral Sets .” 2010. Thesis, Indiana University. Accessed September 26, 2020. http://hdl.handle.net/2022/7345.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Teutsch, Jason Richmond. “Noncomputable Spectral Sets .” 2010. Web. 26 Sep 2020.

Vancouver:

Teutsch JR. Noncomputable Spectral Sets . [Internet] [Thesis]. Indiana University; 2010. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/2022/7345.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Teutsch JR. Noncomputable Spectral Sets . [Thesis]. Indiana University; 2010. Available from: http://hdl.handle.net/2022/7345

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Penn State University

20. Binns, Stephen Ernest. The Medvedev and Muchnik Lattices of Pi-0-1 Classes.

Degree: 2008, Penn State University

 This thesis contains four chapters including the Introduction. It is an analysis of the structure of the Medvedev and Muchnik lattices of non-empty Pi-0-1 classes… (more)

Subjects/Keywords: Medvedev; computability theory; recursion theory; Cantor space; Pi-0-1; Muchnik; recursive functional; small; very small; thin

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Binns, S. E. (2008). The Medvedev and Muchnik Lattices of Pi-0-1 Classes. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/6092

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Binns, Stephen Ernest. “The Medvedev and Muchnik Lattices of Pi-0-1 Classes.” 2008. Thesis, Penn State University. Accessed September 26, 2020. https://submit-etda.libraries.psu.edu/catalog/6092.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Binns, Stephen Ernest. “The Medvedev and Muchnik Lattices of Pi-0-1 Classes.” 2008. Web. 26 Sep 2020.

Vancouver:

Binns SE. The Medvedev and Muchnik Lattices of Pi-0-1 Classes. [Internet] [Thesis]. Penn State University; 2008. [cited 2020 Sep 26]. Available from: https://submit-etda.libraries.psu.edu/catalog/6092.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Binns SE. The Medvedev and Muchnik Lattices of Pi-0-1 Classes. [Thesis]. Penn State University; 2008. Available from: https://submit-etda.libraries.psu.edu/catalog/6092

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

21. Harrison-Trainor, Matthew Alexander. The Complexity of Countable Structures.

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

 We prove various results about the complexity of countable structures, both computable and arbitrary.We begin by investigating descriptions of countable structures in the infinitary logic… (more)

Subjects/Keywords: Mathematics; Logic; computability theory; computable algebra; computable functors; computable structure theory; degree spectra; Scott rank

…methods from computability theory, the domain of all of our structures will be the natural… …computability theory, natural notions tend to relativize nicely. On the other hand, relativizing the… …computability theory, results about natural structures relativize; so if a natural structure has… …consequences in pure computability theory: The degree spectra we build form natural classes of Turing… …undergraduate at the University of Waterloo, and Barbara Csima, who rst introduced me to computability… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Harrison-Trainor, M. A. (2017). The Complexity of Countable Structures. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/3gc9p02k

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Harrison-Trainor, Matthew Alexander. “The Complexity of Countable Structures.” 2017. Thesis, University of California – Berkeley. Accessed September 26, 2020. http://www.escholarship.org/uc/item/3gc9p02k.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Harrison-Trainor, Matthew Alexander. “The Complexity of Countable Structures.” 2017. Web. 26 Sep 2020.

Vancouver:

Harrison-Trainor MA. The Complexity of Countable Structures. [Internet] [Thesis]. University of California – Berkeley; 2017. [cited 2020 Sep 26]. Available from: http://www.escholarship.org/uc/item/3gc9p02k.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Harrison-Trainor MA. The Complexity of Countable Structures. [Thesis]. University of California – Berkeley; 2017. Available from: http://www.escholarship.org/uc/item/3gc9p02k

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

22. LIU YIQUN. TURNING DEGREES CONSTRUCTIONS AND THEIR INDUCTION STRENGTH IN REVERSE MATHEMATICS.

Degree: 2015, National University of Singapore

Subjects/Keywords: Mathematical logic; Computability theory; Reverse recursion theory; Turing degree; priority tree argument; induction strength

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

YIQUN, L. (2015). TURNING DEGREES CONSTRUCTIONS AND THEIR INDUCTION STRENGTH IN REVERSE MATHEMATICS. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/122318

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

YIQUN, LIU. “TURNING DEGREES CONSTRUCTIONS AND THEIR INDUCTION STRENGTH IN REVERSE MATHEMATICS.” 2015. Thesis, National University of Singapore. Accessed September 26, 2020. http://scholarbank.nus.edu.sg/handle/10635/122318.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

YIQUN, LIU. “TURNING DEGREES CONSTRUCTIONS AND THEIR INDUCTION STRENGTH IN REVERSE MATHEMATICS.” 2015. Web. 26 Sep 2020.

Vancouver:

YIQUN L. TURNING DEGREES CONSTRUCTIONS AND THEIR INDUCTION STRENGTH IN REVERSE MATHEMATICS. [Internet] [Thesis]. National University of Singapore; 2015. [cited 2020 Sep 26]. Available from: http://scholarbank.nus.edu.sg/handle/10635/122318.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

YIQUN L. TURNING DEGREES CONSTRUCTIONS AND THEIR INDUCTION STRENGTH IN REVERSE MATHEMATICS. [Thesis]. National University of Singapore; 2015. Available from: http://scholarbank.nus.edu.sg/handle/10635/122318

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universidade Estadual de Campinas

23. Agudelo, Juan Carlos Agudelo. Computação paraconsistente : uma abordagem logica a computação quantica: Paraconsisted computation : a logic approach to quantum.

Degree: 2009, Universidade Estadual de Campinas

 Abstract: This work provides evidences to view computational complexity as logic-relative, by introducing new models of computation through non-classical logics and by studying their features… (more)

Subjects/Keywords: Funções computáveis; Turing, Máquinas de; Circuitos lógicos; Computação quântica; Computability theory; Turing machines; Logical circuits; Quantum computation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Agudelo, J. C. A. (2009). Computação paraconsistente : uma abordagem logica a computação quantica: Paraconsisted computation : a logic approach to quantum. (Thesis). Universidade Estadual de Campinas. Retrieved from http://repositorio.unicamp.br/jspui/handle/REPOSIP/280061

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Agudelo, Juan Carlos Agudelo. “Computação paraconsistente : uma abordagem logica a computação quantica: Paraconsisted computation : a logic approach to quantum.” 2009. Thesis, Universidade Estadual de Campinas. Accessed September 26, 2020. http://repositorio.unicamp.br/jspui/handle/REPOSIP/280061.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Agudelo, Juan Carlos Agudelo. “Computação paraconsistente : uma abordagem logica a computação quantica: Paraconsisted computation : a logic approach to quantum.” 2009. Web. 26 Sep 2020.

Vancouver:

Agudelo JCA. Computação paraconsistente : uma abordagem logica a computação quantica: Paraconsisted computation : a logic approach to quantum. [Internet] [Thesis]. Universidade Estadual de Campinas; 2009. [cited 2020 Sep 26]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/280061.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Agudelo JCA. Computação paraconsistente : uma abordagem logica a computação quantica: Paraconsisted computation : a logic approach to quantum. [Thesis]. Universidade Estadual de Campinas; 2009. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/280061

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

24. Barbieri Lemp, Sebastián Andrés. Shift spaces on groups : computability and dynamics : Calculabilité et dynamique des sous-décalages sur des groupes.

Degree: Docteur es, Informatique, 2017, Lyon

Les sous-décalages sont des ensembles de coloriages d'un groupe définis en excluant certains motifs, et munis d'une action de décalage. Ces objets apparaissent naturellement comme… (more)

Subjects/Keywords: Dynamique symbolique; Systèmes dynamiques; Sous-décalages; Aperiodicité; Calculabilité; Théorèmes de simulation; Théorie des groupes; Invariants de conjugaison; Symbolic dynamics; Dynamical systems; Shift spaces; Aperiodicity; Computability; Simulation theorems; Group theory; Conjugacy invariants

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Barbieri Lemp, S. A. (2017). Shift spaces on groups : computability and dynamics : Calculabilité et dynamique des sous-décalages sur des groupes. (Doctoral Dissertation). Lyon. Retrieved from http://www.theses.fr/2017LYSEN021

Chicago Manual of Style (16th Edition):

Barbieri Lemp, Sebastián Andrés. “Shift spaces on groups : computability and dynamics : Calculabilité et dynamique des sous-décalages sur des groupes.” 2017. Doctoral Dissertation, Lyon. Accessed September 26, 2020. http://www.theses.fr/2017LYSEN021.

MLA Handbook (7th Edition):

Barbieri Lemp, Sebastián Andrés. “Shift spaces on groups : computability and dynamics : Calculabilité et dynamique des sous-décalages sur des groupes.” 2017. Web. 26 Sep 2020.

Vancouver:

Barbieri Lemp SA. Shift spaces on groups : computability and dynamics : Calculabilité et dynamique des sous-décalages sur des groupes. [Internet] [Doctoral dissertation]. Lyon; 2017. [cited 2020 Sep 26]. Available from: http://www.theses.fr/2017LYSEN021.

Council of Science Editors:

Barbieri Lemp SA. Shift spaces on groups : computability and dynamics : Calculabilité et dynamique des sous-décalages sur des groupes. [Doctoral Dissertation]. Lyon; 2017. Available from: http://www.theses.fr/2017LYSEN021

25. Pégny, Maël. Sur les limites empiriques du calcul : calculabilité, complexité et physique : On the empirical limitations on computation : computability, complexity and physics.

Degree: Docteur es, Philosophie, 2013, Paris 1

Durant ces dernières décennies, la communauté informatique a montré un intérêt grandissant pour les modèles de calcul non-standard, inspirés par des phénomènes physiques, biologiques ou… (more)

Subjects/Keywords: Calcul quantique; Philosophie des sciences; Calcul; Informatique; Calculabilité; Complexité computationnelle; Thèse de Church-Turing; Calcul quantique; Quantum computing; Philosophy of science; Computing; Computer science; Computability; Computational complexity; Theory of Church-Turing; Quantum computing; 160

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pégny, M. (2013). Sur les limites empiriques du calcul : calculabilité, complexité et physique : On the empirical limitations on computation : computability, complexity and physics. (Doctoral Dissertation). Paris 1. Retrieved from http://www.theses.fr/2013PA010673

Chicago Manual of Style (16th Edition):

Pégny, Maël. “Sur les limites empiriques du calcul : calculabilité, complexité et physique : On the empirical limitations on computation : computability, complexity and physics.” 2013. Doctoral Dissertation, Paris 1. Accessed September 26, 2020. http://www.theses.fr/2013PA010673.

MLA Handbook (7th Edition):

Pégny, Maël. “Sur les limites empiriques du calcul : calculabilité, complexité et physique : On the empirical limitations on computation : computability, complexity and physics.” 2013. Web. 26 Sep 2020.

Vancouver:

Pégny M. Sur les limites empiriques du calcul : calculabilité, complexité et physique : On the empirical limitations on computation : computability, complexity and physics. [Internet] [Doctoral dissertation]. Paris 1; 2013. [cited 2020 Sep 26]. Available from: http://www.theses.fr/2013PA010673.

Council of Science Editors:

Pégny M. Sur les limites empiriques du calcul : calculabilité, complexité et physique : On the empirical limitations on computation : computability, complexity and physics. [Doctoral Dissertation]. Paris 1; 2013. Available from: http://www.theses.fr/2013PA010673

26. Hellouin de Menibus, Benjamin. Asymptotic behaviour of cellular automata : computation and randomness : Resource allocation and performance metrics analysis in cooperative cellular networks.

Degree: Docteur es, Informatique, 2014, Aix Marseille Université

L'objet de cette thèse est l'étude de l'auto-organisation dans les automates cellulaires unidimensionnels.Les automates cellulaires sont un système dynamique discret ainsi qu'un modèle de calcul… (more)

Subjects/Keywords: Automate cellulaire; Système dynamique; Théorie ergodique; Calculabilité; Analyse calculable; Système de particules en interaction; Marche aléatoire; Mouvement brownien; Cellular automata; Dynamical system; Ergodic theory; Computability; Computable analysis; Interaction particle system; Random walk; Brownian motion

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hellouin de Menibus, B. (2014). Asymptotic behaviour of cellular automata : computation and randomness : Resource allocation and performance metrics analysis in cooperative cellular networks. (Doctoral Dissertation). Aix Marseille Université. Retrieved from http://www.theses.fr/2014AIXM4729

Chicago Manual of Style (16th Edition):

Hellouin de Menibus, Benjamin. “Asymptotic behaviour of cellular automata : computation and randomness : Resource allocation and performance metrics analysis in cooperative cellular networks.” 2014. Doctoral Dissertation, Aix Marseille Université. Accessed September 26, 2020. http://www.theses.fr/2014AIXM4729.

MLA Handbook (7th Edition):

Hellouin de Menibus, Benjamin. “Asymptotic behaviour of cellular automata : computation and randomness : Resource allocation and performance metrics analysis in cooperative cellular networks.” 2014. Web. 26 Sep 2020.

Vancouver:

Hellouin de Menibus B. Asymptotic behaviour of cellular automata : computation and randomness : Resource allocation and performance metrics analysis in cooperative cellular networks. [Internet] [Doctoral dissertation]. Aix Marseille Université 2014. [cited 2020 Sep 26]. Available from: http://www.theses.fr/2014AIXM4729.

Council of Science Editors:

Hellouin de Menibus B. Asymptotic behaviour of cellular automata : computation and randomness : Resource allocation and performance metrics analysis in cooperative cellular networks. [Doctoral Dissertation]. Aix Marseille Université 2014. Available from: http://www.theses.fr/2014AIXM4729

27. Vinogradova, Polina. Formalizing Abstract Computability: Turing Categories in Coq .

Degree: 2017, University of Ottawa

 The concept of a recursive function has been extensively studied using traditional tools of computability theory. However, with the development of category-theoretic methods it has… (more)

Subjects/Keywords: Category theory; Turing categories; Computability; Calculus of Inductive Constructions (CIC); Formalization; Coq proof assistant

theory of computability (or recursion) built around it, has historically been the… …about traditional computability theory used in this thesis, can be found in [20]… …Recall that in traditional computability theory, the halting set is {(x, y) : x… …Many concepts of traditional recursion and computation theory have begun to be effectively… …categorical development of the foundations of recursion theory. Now, theoretical computer science… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vinogradova, P. (2017). Formalizing Abstract Computability: Turing Categories in Coq . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/36354

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Vinogradova, Polina. “Formalizing Abstract Computability: Turing Categories in Coq .” 2017. Thesis, University of Ottawa. Accessed September 26, 2020. http://hdl.handle.net/10393/36354.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Vinogradova, Polina. “Formalizing Abstract Computability: Turing Categories in Coq .” 2017. Web. 26 Sep 2020.

Vancouver:

Vinogradova P. Formalizing Abstract Computability: Turing Categories in Coq . [Internet] [Thesis]. University of Ottawa; 2017. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/10393/36354.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vinogradova P. Formalizing Abstract Computability: Turing Categories in Coq . [Thesis]. University of Ottawa; 2017. Available from: http://hdl.handle.net/10393/36354

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

28. Dudko, Artem. Dynamics of Holomorphic Maps: Resurgence of Fatou coordinates, and Poly-time Computability of Julia Sets.

Degree: 2012, University of Toronto

The present thesis is dedicated to two topics in Dynamics of Holomorphic maps. The first topic is dynamics of simple parabolic germs at the origin.… (more)

Subjects/Keywords: Holomorphic dynamics; Resurgence Theory; Computability and Computational Complexity; Simple Parabolic Germs; 0280

…in [17] relies on the so called Resurgence Theory. Ecalle’s Resurgence results… …coordinates. ´ In [16] and [17] Ecalle gave a construction of Resurgence Theory… …proofs of J. Ecalle’s Resurgence results for the general case. Resurgence Theory is based on… …power series. Using Ecalle’s Resurgence Theory we will show that the right hand side of… …example in his theory of resurgent functions [16, 18]. The series v∗ diverges… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dudko, A. (2012). Dynamics of Holomorphic Maps: Resurgence of Fatou coordinates, and Poly-time Computability of Julia Sets. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/33985

Chicago Manual of Style (16th Edition):

Dudko, Artem. “Dynamics of Holomorphic Maps: Resurgence of Fatou coordinates, and Poly-time Computability of Julia Sets.” 2012. Doctoral Dissertation, University of Toronto. Accessed September 26, 2020. http://hdl.handle.net/1807/33985.

MLA Handbook (7th Edition):

Dudko, Artem. “Dynamics of Holomorphic Maps: Resurgence of Fatou coordinates, and Poly-time Computability of Julia Sets.” 2012. Web. 26 Sep 2020.

Vancouver:

Dudko A. Dynamics of Holomorphic Maps: Resurgence of Fatou coordinates, and Poly-time Computability of Julia Sets. [Internet] [Doctoral dissertation]. University of Toronto; 2012. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/1807/33985.

Council of Science Editors:

Dudko A. Dynamics of Holomorphic Maps: Resurgence of Fatou coordinates, and Poly-time Computability of Julia Sets. [Doctoral Dissertation]. University of Toronto; 2012. Available from: http://hdl.handle.net/1807/33985

29. Bauwens, Bruno. Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity.

Degree: 2010, Ghent University

Subjects/Keywords: Mathematics and Statistics; Computability theory; minimal sufficient statistics; influence in time series; statistical hypothesis testing; ideal sequence analysis; Kolmogorov complexity; causality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bauwens, B. (2010). Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity. (Thesis). Ghent University. Retrieved from http://hdl.handle.net/1854/LU-1107852

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Bauwens, Bruno. “Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity.” 2010. Thesis, Ghent University. Accessed September 26, 2020. http://hdl.handle.net/1854/LU-1107852.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Bauwens, Bruno. “Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity.” 2010. Web. 26 Sep 2020.

Vancouver:

Bauwens B. Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity. [Internet] [Thesis]. Ghent University; 2010. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/1854/LU-1107852.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bauwens B. Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity. [Thesis]. Ghent University; 2010. Available from: http://hdl.handle.net/1854/LU-1107852

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universitetet i Tromsø

30. Leer, Erik Bræck. Detecting events in videos using semantic analytics of subtitles .

Degree: 2011, Universitetet i Tromsø

 Recently, television broadcasters such as the NRK and TV2 channels, have begun offering live internet television and movie archive along with their regular schedule, much… (more)

Subjects/Keywords: VDP::Matematikk og Naturvitenskap: 400::Informasjons- og kommunikasjonsvitenskap: 420::Algoritmer og beregnbarhetsteori: 422; VDP::Mathematics and natural science: 400::Information and communication science: 420::Algorithms and computability theory: 422; VDP::Matematikk og Naturvitenskap: 400::Informasjons- og kommunikasjonsvitenskap: 420::Kommunikasjon og distribuerte systemer: 423; VDP::Mathematics and natural science: 400::Information and communication science: 420::Communication and distributed systems: 423; VDP::Matematikk og Naturvitenskap: 400::Informasjons- og kommunikasjonsvitenskap: 420::Systemutvikling og -arbeid: 426; VDP::Mathematics and natural science: 400::Information and communication science: 420::System development and system design: 426

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Leer, E. B. (2011). Detecting events in videos using semantic analytics of subtitles . (Masters Thesis). Universitetet i Tromsø. Retrieved from http://hdl.handle.net/10037/3521

Chicago Manual of Style (16th Edition):

Leer, Erik Bræck. “Detecting events in videos using semantic analytics of subtitles .” 2011. Masters Thesis, Universitetet i Tromsø. Accessed September 26, 2020. http://hdl.handle.net/10037/3521.

MLA Handbook (7th Edition):

Leer, Erik Bræck. “Detecting events in videos using semantic analytics of subtitles .” 2011. Web. 26 Sep 2020.

Vancouver:

Leer EB. Detecting events in videos using semantic analytics of subtitles . [Internet] [Masters thesis]. Universitetet i Tromsø 2011. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/10037/3521.

Council of Science Editors:

Leer EB. Detecting events in videos using semantic analytics of subtitles . [Masters Thesis]. Universitetet i Tromsø 2011. Available from: http://hdl.handle.net/10037/3521

[1] [2]

.