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:(Recursion). Showing records 1 – 30 of 115 total matches.

[1] [2] [3] [4]

Search Limiters

Last 2 Years | English Only

Levels

Country

▼ Search Limiters


University of Edinburgh

1. Jackson, Tom. Recursion in an iterated learning experiment.

Degree: 2013, University of Edinburgh

 In recent years there has been much debate concerning the human language faculty and the presence of a recursive mechanism in our mental grammar. In… (more)

Subjects/Keywords: Recursion; Iterated Learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jackson, T. (2013). Recursion in an iterated learning experiment. (Thesis). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/8657

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):

Jackson, Tom. “Recursion in an iterated learning experiment.” 2013. Thesis, University of Edinburgh. Accessed April 09, 2020. http://hdl.handle.net/1842/8657.

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

MLA Handbook (7th Edition):

Jackson, Tom. “Recursion in an iterated learning experiment.” 2013. Web. 09 Apr 2020.

Vancouver:

Jackson T. Recursion in an iterated learning experiment. [Internet] [Thesis]. University of Edinburgh; 2013. [cited 2020 Apr 09]. Available from: http://hdl.handle.net/1842/8657.

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

Council of Science Editors:

Jackson T. Recursion in an iterated learning experiment. [Thesis]. University of Edinburgh; 2013. Available from: http://hdl.handle.net/1842/8657

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


University of Alberta

2. Kroll, Jeffrey P. Topological Recursion and the Supereigenvalue Model.

Degree: MS, Department of Mathematical and Statistical Sciences, 2012, University of Alberta

 This thesis is interested in the topological recursion first introduced in and generalized to algebraic curves in . A presentation of the Hermitian matrix model… (more)

Subjects/Keywords: matrix models; topological recursion; supereigenvalue

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kroll, J. P. (2012). Topological Recursion and the Supereigenvalue Model. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/x633f272z

Chicago Manual of Style (16th Edition):

Kroll, Jeffrey P. “Topological Recursion and the Supereigenvalue Model.” 2012. Masters Thesis, University of Alberta. Accessed April 09, 2020. https://era.library.ualberta.ca/files/x633f272z.

MLA Handbook (7th Edition):

Kroll, Jeffrey P. “Topological Recursion and the Supereigenvalue Model.” 2012. Web. 09 Apr 2020.

Vancouver:

Kroll JP. Topological Recursion and the Supereigenvalue Model. [Internet] [Masters thesis]. University of Alberta; 2012. [cited 2020 Apr 09]. Available from: https://era.library.ualberta.ca/files/x633f272z.

Council of Science Editors:

Kroll JP. Topological Recursion and the Supereigenvalue Model. [Masters Thesis]. University of Alberta; 2012. Available from: https://era.library.ualberta.ca/files/x633f272z


University of Edinburgh

3. Mason, Julia. Meaning Predictability and Recursion in Onomasiology.

Degree: 2011, University of Edinburgh

 The following study of recursive naming units sought to test the methods of meaning predictability outlined in Štekauer’s (2005a) onomasiological account of word-formation. One of… (more)

Subjects/Keywords: onomasiology; word-formation; recursion; compound

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mason, J. (2011). Meaning Predictability and Recursion in Onomasiology. (Thesis). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/6086

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):

Mason, Julia. “Meaning Predictability and Recursion in Onomasiology.” 2011. Thesis, University of Edinburgh. Accessed April 09, 2020. http://hdl.handle.net/1842/6086.

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

MLA Handbook (7th Edition):

Mason, Julia. “Meaning Predictability and Recursion in Onomasiology.” 2011. Web. 09 Apr 2020.

Vancouver:

Mason J. Meaning Predictability and Recursion in Onomasiology. [Internet] [Thesis]. University of Edinburgh; 2011. [cited 2020 Apr 09]. Available from: http://hdl.handle.net/1842/6086.

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

Council of Science Editors:

Mason J. Meaning Predictability and Recursion in Onomasiology. [Thesis]. University of Edinburgh; 2011. Available from: http://hdl.handle.net/1842/6086

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


UCLA

4. Bhaskar, Siddharth. Recursion versus Tail Recursion over Abstract Structures.

Degree: Mathematics, 2015, UCLA

 There are several ways to understand computability over first-order structures. We may admit functions given by arbitrary recursive definitions, or we may restrict ourselves to… (more)

Subjects/Keywords: Logic; Computer science; Mathematics; Algebra; Recursion theory; Tail recursion

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bhaskar, S. (2015). Recursion versus Tail Recursion over Abstract Structures. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/30x2k93q

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):

Bhaskar, Siddharth. “Recursion versus Tail Recursion over Abstract Structures.” 2015. Thesis, UCLA. Accessed April 09, 2020. http://www.escholarship.org/uc/item/30x2k93q.

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

MLA Handbook (7th Edition):

Bhaskar, Siddharth. “Recursion versus Tail Recursion over Abstract Structures.” 2015. Web. 09 Apr 2020.

Vancouver:

Bhaskar S. Recursion versus Tail Recursion over Abstract Structures. [Internet] [Thesis]. UCLA; 2015. [cited 2020 Apr 09]. Available from: http://www.escholarship.org/uc/item/30x2k93q.

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

Council of Science Editors:

Bhaskar S. Recursion versus Tail Recursion over Abstract Structures. [Thesis]. UCLA; 2015. Available from: http://www.escholarship.org/uc/item/30x2k93q

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


University of Alberta

5. Chotai, Anand W. Extension of WKB-Topological Recursion Connection.

Degree: MS, Department of Mathematical and Statistical Sciences, 2016, University of Alberta

 It has been proven in other sources that spectral curves, (Σ,x,y), where Σ is a compact Riemann surface, and meromophic functions x and y satisfy… (more)

Subjects/Keywords: Topological Recursion; WKB; Mirror Symmetry; Hurwitz Numbers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chotai, A. W. (2016). Extension of WKB-Topological Recursion Connection. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/c8623hz062

Chicago Manual of Style (16th Edition):

Chotai, Anand W. “Extension of WKB-Topological Recursion Connection.” 2016. Masters Thesis, University of Alberta. Accessed April 09, 2020. https://era.library.ualberta.ca/files/c8623hz062.

MLA Handbook (7th Edition):

Chotai, Anand W. “Extension of WKB-Topological Recursion Connection.” 2016. Web. 09 Apr 2020.

Vancouver:

Chotai AW. Extension of WKB-Topological Recursion Connection. [Internet] [Masters thesis]. University of Alberta; 2016. [cited 2020 Apr 09]. Available from: https://era.library.ualberta.ca/files/c8623hz062.

Council of Science Editors:

Chotai AW. Extension of WKB-Topological Recursion Connection. [Masters Thesis]. University of Alberta; 2016. Available from: https://era.library.ualberta.ca/files/c8623hz062


University of Notre Dame

6. WonJae Shin. Learning a Recursive Center-Embedding Rule and the Role of Test Method and Feedback</h1>.

Degree: PhD, Psychology, 2014, University of Notre Dame

  Language is a quintessential and complex human skill. One reflection is the ability to produce and understand an infinite number of new sentences (i.e.,… (more)

Subjects/Keywords: Statistical learning; Learning; Grammar; Rule learning; Recursion

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shin, W. (2014). Learning a Recursive Center-Embedding Rule and the Role of Test Method and Feedback</h1>. (Doctoral Dissertation). University of Notre Dame. Retrieved from https://curate.nd.edu/show/nc580k24h9w

Chicago Manual of Style (16th Edition):

Shin, WonJae. “Learning a Recursive Center-Embedding Rule and the Role of Test Method and Feedback</h1>.” 2014. Doctoral Dissertation, University of Notre Dame. Accessed April 09, 2020. https://curate.nd.edu/show/nc580k24h9w.

MLA Handbook (7th Edition):

Shin, WonJae. “Learning a Recursive Center-Embedding Rule and the Role of Test Method and Feedback</h1>.” 2014. Web. 09 Apr 2020.

Vancouver:

Shin W. Learning a Recursive Center-Embedding Rule and the Role of Test Method and Feedback</h1>. [Internet] [Doctoral dissertation]. University of Notre Dame; 2014. [cited 2020 Apr 09]. Available from: https://curate.nd.edu/show/nc580k24h9w.

Council of Science Editors:

Shin W. Learning a Recursive Center-Embedding Rule and the Role of Test Method and Feedback</h1>. [Doctoral Dissertation]. University of Notre Dame; 2014. Available from: https://curate.nd.edu/show/nc580k24h9w


Penn State University

7. Jin, Qingjun. Conformal deformations of N=4 Sym.

Degree: PhD, Physics, 2014, Penn State University

 This thesis focuses on the calculation and application of scattering amplitude. We present recursion relations which can be used to compute tree level scattering amplitude… (more)

Subjects/Keywords: Scattering amplitude; BCFW recursion; Conformal field theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jin, Q. (2014). Conformal deformations of N=4 Sym. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/22791

Chicago Manual of Style (16th Edition):

Jin, Qingjun. “Conformal deformations of N=4 Sym.” 2014. Doctoral Dissertation, Penn State University. Accessed April 09, 2020. https://etda.libraries.psu.edu/catalog/22791.

MLA Handbook (7th Edition):

Jin, Qingjun. “Conformal deformations of N=4 Sym.” 2014. Web. 09 Apr 2020.

Vancouver:

Jin Q. Conformal deformations of N=4 Sym. [Internet] [Doctoral dissertation]. Penn State University; 2014. [cited 2020 Apr 09]. Available from: https://etda.libraries.psu.edu/catalog/22791.

Council of Science Editors:

Jin Q. Conformal deformations of N=4 Sym. [Doctoral Dissertation]. Penn State University; 2014. Available from: https://etda.libraries.psu.edu/catalog/22791


University of California – Berkeley

8. 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 April 09, 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. 09 Apr 2020.

Vancouver:

Igusa G. Generic Reduction, and Work with Partial Computations and Partial Oracles. [Internet] [Thesis]. University of California – Berkeley; 2013. [cited 2020 Apr 09]. 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


University of New Mexico

9. Adam, Christopher. Three-Dimensional Constraints on Human Cognition as Expressed in Human Language.

Degree: Department of Linguistics, 2015, University of New Mexico

 Those advocating the existence of a distinct language instinct generally claim that human language is not reliant on general human cognition. However, limitations on recursive… (more)

Subjects/Keywords: recursion; center embedding; discontinuous constituency; haplology; metathesis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Adam, C. (2015). Three-Dimensional Constraints on Human Cognition as Expressed in Human Language. (Doctoral Dissertation). University of New Mexico. Retrieved from https://digitalrepository.unm.edu/ling_etds/1

Chicago Manual of Style (16th Edition):

Adam, Christopher. “Three-Dimensional Constraints on Human Cognition as Expressed in Human Language.” 2015. Doctoral Dissertation, University of New Mexico. Accessed April 09, 2020. https://digitalrepository.unm.edu/ling_etds/1.

MLA Handbook (7th Edition):

Adam, Christopher. “Three-Dimensional Constraints on Human Cognition as Expressed in Human Language.” 2015. Web. 09 Apr 2020.

Vancouver:

Adam C. Three-Dimensional Constraints on Human Cognition as Expressed in Human Language. [Internet] [Doctoral dissertation]. University of New Mexico; 2015. [cited 2020 Apr 09]. Available from: https://digitalrepository.unm.edu/ling_etds/1.

Council of Science Editors:

Adam C. Three-Dimensional Constraints on Human Cognition as Expressed in Human Language. [Doctoral Dissertation]. University of New Mexico; 2015. Available from: https://digitalrepository.unm.edu/ling_etds/1


University of Melbourne

10. Scott, Nicky Jason. Polynomial hierarchies generated by Eynard-Orantin invariants.

Degree: 2011, University of Melbourne

 This thesis examines analytic properties of the Eynard-Orantin invariants of rational curves with two branch points. These are meromorphic multidifferential forms that live on a… (more)

Subjects/Keywords: Eynard-Orantin; topological recursion; Gromov-Witten invariants

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Scott, N. J. (2011). Polynomial hierarchies generated by Eynard-Orantin invariants. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/36986

Chicago Manual of Style (16th Edition):

Scott, Nicky Jason. “Polynomial hierarchies generated by Eynard-Orantin invariants.” 2011. Doctoral Dissertation, University of Melbourne. Accessed April 09, 2020. http://hdl.handle.net/11343/36986.

MLA Handbook (7th Edition):

Scott, Nicky Jason. “Polynomial hierarchies generated by Eynard-Orantin invariants.” 2011. Web. 09 Apr 2020.

Vancouver:

Scott NJ. Polynomial hierarchies generated by Eynard-Orantin invariants. [Internet] [Doctoral dissertation]. University of Melbourne; 2011. [cited 2020 Apr 09]. Available from: http://hdl.handle.net/11343/36986.

Council of Science Editors:

Scott NJ. Polynomial hierarchies generated by Eynard-Orantin invariants. [Doctoral Dissertation]. University of Melbourne; 2011. Available from: http://hdl.handle.net/11343/36986


University of Edinburgh

11. Saldana, Carmen. The Evolution Of Phrase Structure In Bayesian Iterated Artificial Language Learning: A Linguistic System’s Evolution After The Emergence Of An Unbounded Combinatorial Capacity.

Degree: 2013, University of Edinburgh

 An elementary fact about language is that it is a system of discrete infinity whose source is recursion and reveals itself as Phrase Structure Grammar.… (more)

Subjects/Keywords: Bayesian Iterated Learning; Phrase Structure; domain-general; recursion

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Saldana, C. (2013). The Evolution Of Phrase Structure In Bayesian Iterated Artificial Language Learning: A Linguistic System’s Evolution After The Emergence Of An Unbounded Combinatorial Capacity. (Thesis). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/8662

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):

Saldana, Carmen. “The Evolution Of Phrase Structure In Bayesian Iterated Artificial Language Learning: A Linguistic System’s Evolution After The Emergence Of An Unbounded Combinatorial Capacity.” 2013. Thesis, University of Edinburgh. Accessed April 09, 2020. http://hdl.handle.net/1842/8662.

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

MLA Handbook (7th Edition):

Saldana, Carmen. “The Evolution Of Phrase Structure In Bayesian Iterated Artificial Language Learning: A Linguistic System’s Evolution After The Emergence Of An Unbounded Combinatorial Capacity.” 2013. Web. 09 Apr 2020.

Vancouver:

Saldana C. The Evolution Of Phrase Structure In Bayesian Iterated Artificial Language Learning: A Linguistic System’s Evolution After The Emergence Of An Unbounded Combinatorial Capacity. [Internet] [Thesis]. University of Edinburgh; 2013. [cited 2020 Apr 09]. Available from: http://hdl.handle.net/1842/8662.

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

Council of Science Editors:

Saldana C. The Evolution Of Phrase Structure In Bayesian Iterated Artificial Language Learning: A Linguistic System’s Evolution After The Emergence Of An Unbounded Combinatorial Capacity. [Thesis]. University of Edinburgh; 2013. Available from: http://hdl.handle.net/1842/8662

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


Rochester Institute of Technology

12. Voelker, Karl. Practical programming with total functions.

Degree: Computer Science (GCCIS), 2010, Rochester Institute of Technology

 Functional programming offers an advantage over imperative programming: functional programs are easier to reason about and understand, which makes certain classes of errors less common.… (more)

Subjects/Keywords: Functional programming; Haskell; Structural recursion; Termination; Total functional programming; Totality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Voelker, K. (2010). Practical programming with total functions. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/120

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):

Voelker, Karl. “Practical programming with total functions.” 2010. Thesis, Rochester Institute of Technology. Accessed April 09, 2020. https://scholarworks.rit.edu/theses/120.

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

MLA Handbook (7th Edition):

Voelker, Karl. “Practical programming with total functions.” 2010. Web. 09 Apr 2020.

Vancouver:

Voelker K. Practical programming with total functions. [Internet] [Thesis]. Rochester Institute of Technology; 2010. [cited 2020 Apr 09]. Available from: https://scholarworks.rit.edu/theses/120.

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

Council of Science Editors:

Voelker K. Practical programming with total functions. [Thesis]. Rochester Institute of Technology; 2010. Available from: https://scholarworks.rit.edu/theses/120

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


NSYSU

13. Liu, Min-Hua. An Optimized Semi-parallel Architecture Design of Successive-cancellation Polar Decoder.

Degree: Master, Computer Science and Engineering, 2017, NSYSU

 This thesis proposes a high-efï¬cient VLSI decoder architecture for polar code which is capable of achieving channel capacity and ï¬exibly realizing various code rates. The… (more)

Subjects/Keywords: Polar code; FPGA; Partial sum generator; Recursion decoding; Successive-cancellation algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, M. (2017). An Optimized Semi-parallel Architecture Design of Successive-cancellation Polar Decoder. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0016117-154531

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):

Liu, Min-Hua. “An Optimized Semi-parallel Architecture Design of Successive-cancellation Polar Decoder.” 2017. Thesis, NSYSU. Accessed April 09, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0016117-154531.

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

MLA Handbook (7th Edition):

Liu, Min-Hua. “An Optimized Semi-parallel Architecture Design of Successive-cancellation Polar Decoder.” 2017. Web. 09 Apr 2020.

Vancouver:

Liu M. An Optimized Semi-parallel Architecture Design of Successive-cancellation Polar Decoder. [Internet] [Thesis]. NSYSU; 2017. [cited 2020 Apr 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0016117-154531.

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

Council of Science Editors:

Liu M. An Optimized Semi-parallel Architecture Design of Successive-cancellation Polar Decoder. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0016117-154531

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

14. Werven, J.F. van. Reconsidering Recursion.

Degree: 2015, Universiteit Utrecht

 The current study investigates to what extent the term 'recursion' is perceived differently among scholars from different fields. It is shown that recursion started out… (more)

Subjects/Keywords: Recursion; syntax; Chomsky; confusion

…2. Recursion in the formal sciences 2.1 Recursion in mathematics Originally, recursion… …of induction scheme…, a general scheme… which we call recursion. This way of defining… …two characteristics of recursion: firstly, its self-reference and secondly, the possibility… …full-blown recursion, by which he means nested (and supposedly structural)… …recursion, is not convertible to iteration.1 In the same line, Parker (2006: 186) tells… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Werven, J. F. v. (2015). Reconsidering Recursion. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/307809

Chicago Manual of Style (16th Edition):

Werven, J F van. “Reconsidering Recursion.” 2015. Masters Thesis, Universiteit Utrecht. Accessed April 09, 2020. http://dspace.library.uu.nl:8080/handle/1874/307809.

MLA Handbook (7th Edition):

Werven, J F van. “Reconsidering Recursion.” 2015. Web. 09 Apr 2020.

Vancouver:

Werven JFv. Reconsidering Recursion. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2020 Apr 09]. Available from: http://dspace.library.uu.nl:8080/handle/1874/307809.

Council of Science Editors:

Werven JFv. Reconsidering Recursion. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/307809

15. CERON URIBE, SANTIAGO. Kleene’s Second Recursion Theorem: Overview, Implementation and Applications to Computer Virology .

Degree: 2015, Universidad de los Andes

 Este documento autocontenido presenta tanto la teoría necesaria para llegar al Segundo Teorema de la Recursión de Kleene (SRT) como teoría que se deriva de… (more)

Subjects/Keywords: recursion; SRT; Kleene; computability; virus

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

CERON URIBE, S. (2015). Kleene’s Second Recursion Theorem: Overview, Implementation and Applications to Computer Virology . (Thesis). Universidad de los Andes. Retrieved from https://documentodegrado.uniandes.edu.co/documentos/9865.pdf

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):

CERON URIBE, SANTIAGO. “Kleene’s Second Recursion Theorem: Overview, Implementation and Applications to Computer Virology .” 2015. Thesis, Universidad de los Andes. Accessed April 09, 2020. https://documentodegrado.uniandes.edu.co/documentos/9865.pdf.

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

MLA Handbook (7th Edition):

CERON URIBE, SANTIAGO. “Kleene’s Second Recursion Theorem: Overview, Implementation and Applications to Computer Virology .” 2015. Web. 09 Apr 2020.

Vancouver:

CERON URIBE S. Kleene’s Second Recursion Theorem: Overview, Implementation and Applications to Computer Virology . [Internet] [Thesis]. Universidad de los Andes; 2015. [cited 2020 Apr 09]. Available from: https://documentodegrado.uniandes.edu.co/documentos/9865.pdf.

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

Council of Science Editors:

CERON URIBE S. Kleene’s Second Recursion Theorem: Overview, Implementation and Applications to Computer Virology . [Thesis]. Universidad de los Andes; 2015. Available from: https://documentodegrado.uniandes.edu.co/documentos/9865.pdf

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


Virginia Tech

16. Hamouda, Sally Mohamed Fathy Mo. Enhancing Learning of Recursion.

Degree: PhD, Computer Science, 2015, Virginia Tech

Recursion is one of the most important and hardest topics in lower division computer science courses. As it is an advanced programming skill, the best… (more)

Subjects/Keywords: Recursion; Online Learning; Automated Assessment; Concept Inventory; Binary Trees

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hamouda, S. M. F. M. (2015). Enhancing Learning of Recursion. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/64249

Chicago Manual of Style (16th Edition):

Hamouda, Sally Mohamed Fathy Mo. “Enhancing Learning of Recursion.” 2015. Doctoral Dissertation, Virginia Tech. Accessed April 09, 2020. http://hdl.handle.net/10919/64249.

MLA Handbook (7th Edition):

Hamouda, Sally Mohamed Fathy Mo. “Enhancing Learning of Recursion.” 2015. Web. 09 Apr 2020.

Vancouver:

Hamouda SMFM. Enhancing Learning of Recursion. [Internet] [Doctoral dissertation]. Virginia Tech; 2015. [cited 2020 Apr 09]. Available from: http://hdl.handle.net/10919/64249.

Council of Science Editors:

Hamouda SMFM. Enhancing Learning of Recursion. [Doctoral Dissertation]. Virginia Tech; 2015. Available from: http://hdl.handle.net/10919/64249


Wesleyan University

17. Kim, Theodore Seok. Cost Semantics for Plotkin's PCF.

Degree: Computer Science, 2016, Wesleyan University

  We develop a formalism for extracting recurrences from programs written in a variant of Plotkin's PCF, a typed higher-order functional language that integrates functions… (more)

Subjects/Keywords: Semi-automatic complexity analysis; general recursion; Plotkin's PCF

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kim, T. S. (2016). Cost Semantics for Plotkin's PCF. (Masters Thesis). Wesleyan University. Retrieved from https://wesscholar.wesleyan.edu/etd_mas_theses/130

Chicago Manual of Style (16th Edition):

Kim, Theodore Seok. “Cost Semantics for Plotkin's PCF.” 2016. Masters Thesis, Wesleyan University. Accessed April 09, 2020. https://wesscholar.wesleyan.edu/etd_mas_theses/130.

MLA Handbook (7th Edition):

Kim, Theodore Seok. “Cost Semantics for Plotkin's PCF.” 2016. Web. 09 Apr 2020.

Vancouver:

Kim TS. Cost Semantics for Plotkin's PCF. [Internet] [Masters thesis]. Wesleyan University; 2016. [cited 2020 Apr 09]. Available from: https://wesscholar.wesleyan.edu/etd_mas_theses/130.

Council of Science Editors:

Kim TS. Cost Semantics for Plotkin's PCF. [Masters Thesis]. Wesleyan University; 2016. Available from: https://wesscholar.wesleyan.edu/etd_mas_theses/130

18. LIU YONG. THE STRUCTURE OF D.R.E. DEGREES.

Degree: 2017, National University of Singapore

Subjects/Keywords: Recursion theory; d.r.e. degrees

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

YONG, L. (2017). THE STRUCTURE OF D.R.E. DEGREES. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/138177

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):

YONG, LIU. “THE STRUCTURE OF D.R.E. DEGREES.” 2017. Thesis, National University of Singapore. Accessed April 09, 2020. http://scholarbank.nus.edu.sg/handle/10635/138177.

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

MLA Handbook (7th Edition):

YONG, LIU. “THE STRUCTURE OF D.R.E. DEGREES.” 2017. Web. 09 Apr 2020.

Vancouver:

YONG L. THE STRUCTURE OF D.R.E. DEGREES. [Internet] [Thesis]. National University of Singapore; 2017. [cited 2020 Apr 09]. Available from: http://scholarbank.nus.edu.sg/handle/10635/138177.

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

Council of Science Editors:

YONG L. THE STRUCTURE OF D.R.E. DEGREES. [Thesis]. National University of Singapore; 2017. Available from: http://scholarbank.nus.edu.sg/handle/10635/138177

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


UCLA

19. Arant, Tyler James. The Effective Theory of Graphs, Equivalence Relations, and Polish Spaces.

Degree: Mathematics, 2019, UCLA

 This dissertation examines the effective theory of Borel graph combinatorics and analytic equivalence relations, as well as the theory of recursive Polish spaces. In Chapter… (more)

Subjects/Keywords: Mathematics; Logic; descriptive set theory; equivalence relations; graphs; logic; recursion theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arant, T. J. (2019). The Effective Theory of Graphs, Equivalence Relations, and Polish Spaces. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/1z9490p0

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):

Arant, Tyler James. “The Effective Theory of Graphs, Equivalence Relations, and Polish Spaces.” 2019. Thesis, UCLA. Accessed April 09, 2020. http://www.escholarship.org/uc/item/1z9490p0.

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

MLA Handbook (7th Edition):

Arant, Tyler James. “The Effective Theory of Graphs, Equivalence Relations, and Polish Spaces.” 2019. Web. 09 Apr 2020.

Vancouver:

Arant TJ. The Effective Theory of Graphs, Equivalence Relations, and Polish Spaces. [Internet] [Thesis]. UCLA; 2019. [cited 2020 Apr 09]. Available from: http://www.escholarship.org/uc/item/1z9490p0.

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

Council of Science Editors:

Arant TJ. The Effective Theory of Graphs, Equivalence Relations, and Polish Spaces. [Thesis]. UCLA; 2019. Available from: http://www.escholarship.org/uc/item/1z9490p0

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


University of North Texas

20. McConnell, Michael Constantine. Outer Reaches of the Palindrome.

Degree: 2003, University of North Texas

 This work is an exploration into the palindrome, both as a literary form and an expression of infinity. The first two chapters address the fascinating… (more)

Subjects/Keywords: Palindromes.; Palindrome; recursion; spriral

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McConnell, M. C. (2003). Outer Reaches of the Palindrome. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc4407/

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):

McConnell, Michael Constantine. “Outer Reaches of the Palindrome.” 2003. Thesis, University of North Texas. Accessed April 09, 2020. https://digital.library.unt.edu/ark:/67531/metadc4407/.

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

MLA Handbook (7th Edition):

McConnell, Michael Constantine. “Outer Reaches of the Palindrome.” 2003. Web. 09 Apr 2020.

Vancouver:

McConnell MC. Outer Reaches of the Palindrome. [Internet] [Thesis]. University of North Texas; 2003. [cited 2020 Apr 09]. Available from: https://digital.library.unt.edu/ark:/67531/metadc4407/.

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

Council of Science Editors:

McConnell MC. Outer Reaches of the Palindrome. [Thesis]. University of North Texas; 2003. Available from: https://digital.library.unt.edu/ark:/67531/metadc4407/

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

21. Barnes, James Samuel. Decidability in the Hyperdegrees and a Theorem of Hyperarithmetic Analysis .

Degree: 2018, Cornell University

 In this thesis we explore two different topics: the complexity of the theory of the hyperdegrees, and the reverse mathematics of a result in graph… (more)

Subjects/Keywords: Computability; Hyperarithmetic; Recursion; Logic

…Decision procedures 138 Bibliography 142 vii CHAPTER 1 INTRODUCTION Recursion theory is a… …give a brief overview of some basics in recursion theory that will be needed later. For more… …chapter are mine; they all occur in Sacks’ Higher Recursion Theory [19]. Where… …to the Z-constructive ordinals. 12 2.2 Effective transfinite recursion The definition… …of R and Φe = Φh(e) . The proof of this theorem uses the recursion theorem: If… 

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):

Barnes, J. S. (2018). Decidability in the Hyperdegrees and a Theorem of Hyperarithmetic Analysis . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/59704

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):

Barnes, James Samuel. “Decidability in the Hyperdegrees and a Theorem of Hyperarithmetic Analysis .” 2018. Thesis, Cornell University. Accessed April 09, 2020. http://hdl.handle.net/1813/59704.

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

MLA Handbook (7th Edition):

Barnes, James Samuel. “Decidability in the Hyperdegrees and a Theorem of Hyperarithmetic Analysis .” 2018. Web. 09 Apr 2020.

Vancouver:

Barnes JS. Decidability in the Hyperdegrees and a Theorem of Hyperarithmetic Analysis . [Internet] [Thesis]. Cornell University; 2018. [cited 2020 Apr 09]. Available from: http://hdl.handle.net/1813/59704.

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

Council of Science Editors:

Barnes JS. Decidability in the Hyperdegrees and a Theorem of Hyperarithmetic Analysis . [Thesis]. Cornell University; 2018. Available from: http://hdl.handle.net/1813/59704

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


University of Melbourne

22. SLEIGH, CALLUM. Eynard-Orantin theory of the A-polynomial.

Degree: 2013, University of Melbourne

 This thesis studies the Eynard-Orantin invariants of an important knot invariant: the A-polynomial. In particular, period integrals of the Eynard-Orantin invariants are studied. First, formulae… (more)

Subjects/Keywords: A-polynomial; Chern-Simons Theory; integrable systems; topological recursion

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

SLEIGH, C. (2013). Eynard-Orantin theory of the A-polynomial. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/38442

Chicago Manual of Style (16th Edition):

SLEIGH, CALLUM. “Eynard-Orantin theory of the A-polynomial.” 2013. Doctoral Dissertation, University of Melbourne. Accessed April 09, 2020. http://hdl.handle.net/11343/38442.

MLA Handbook (7th Edition):

SLEIGH, CALLUM. “Eynard-Orantin theory of the A-polynomial.” 2013. Web. 09 Apr 2020.

Vancouver:

SLEIGH C. Eynard-Orantin theory of the A-polynomial. [Internet] [Doctoral dissertation]. University of Melbourne; 2013. [cited 2020 Apr 09]. Available from: http://hdl.handle.net/11343/38442.

Council of Science Editors:

SLEIGH C. Eynard-Orantin theory of the A-polynomial. [Doctoral Dissertation]. University of Melbourne; 2013. Available from: http://hdl.handle.net/11343/38442


University of Melbourne

23. Soh, Pei Ling Joey. Light through medium.

Degree: 2015, University of Melbourne

 This research project titled Light Through Medium explores transitory moments in our everyday life that are caused by light phenomenon related to refraction. My research… (more)

Subjects/Keywords: perception; light; installation; reflection; transition; recursion; perception; feelings

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Soh, P. L. J. (2015). Light through medium. (Masters Thesis). University of Melbourne. Retrieved from http://hdl.handle.net/11343/59536

Chicago Manual of Style (16th Edition):

Soh, Pei Ling Joey. “Light through medium.” 2015. Masters Thesis, University of Melbourne. Accessed April 09, 2020. http://hdl.handle.net/11343/59536.

MLA Handbook (7th Edition):

Soh, Pei Ling Joey. “Light through medium.” 2015. Web. 09 Apr 2020.

Vancouver:

Soh PLJ. Light through medium. [Internet] [Masters thesis]. University of Melbourne; 2015. [cited 2020 Apr 09]. Available from: http://hdl.handle.net/11343/59536.

Council of Science Editors:

Soh PLJ. Light through medium. [Masters Thesis]. University of Melbourne; 2015. Available from: http://hdl.handle.net/11343/59536


University of St. Andrews

24. Kambouroudis, Dimos S. Essays on volatility forecasting .

Degree: 2012, University of St. Andrews

 Stock market volatility has been an important subject in the finance literature for which now an enormous body of research exists. Volatility modelling and forecasting… (more)

Subjects/Keywords: Volatility forecasting; GARCH; Backward recursion; VaR; Riskmetrics; VIX; Trading volume

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kambouroudis, D. S. (2012). Essays on volatility forecasting . (Thesis). University of St. Andrews. Retrieved from http://hdl.handle.net/10023/3191

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):

Kambouroudis, Dimos S. “Essays on volatility forecasting .” 2012. Thesis, University of St. Andrews. Accessed April 09, 2020. http://hdl.handle.net/10023/3191.

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

MLA Handbook (7th Edition):

Kambouroudis, Dimos S. “Essays on volatility forecasting .” 2012. Web. 09 Apr 2020.

Vancouver:

Kambouroudis DS. Essays on volatility forecasting . [Internet] [Thesis]. University of St. Andrews; 2012. [cited 2020 Apr 09]. Available from: http://hdl.handle.net/10023/3191.

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

Council of Science Editors:

Kambouroudis DS. Essays on volatility forecasting . [Thesis]. University of St. Andrews; 2012. Available from: http://hdl.handle.net/10023/3191

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


Universidade do Rio Grande do Sul

25. Silva, Shanna Lauda Ferreira da. A recursividade e seu papel na faculdade da linguagem da espécie humana.

Degree: 2014, Universidade do Rio Grande do Sul

O presente trabalho visa analisar a relevância da propriedade recursiva na definição da maneira como a faculdade da linguagem se apresenta na cognição da espécie… (more)

Subjects/Keywords: Recursividade (Linguística); Recursion; Estudos da linguagem; Language faculty; Gramática gerativa; Cognition; Linguagem e línguas

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Silva, S. L. F. d. (2014). A recursividade e seu papel na faculdade da linguagem da espécie humana. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/103872

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):

Silva, Shanna Lauda Ferreira da. “A recursividade e seu papel na faculdade da linguagem da espécie humana.” 2014. Thesis, Universidade do Rio Grande do Sul. Accessed April 09, 2020. http://hdl.handle.net/10183/103872.

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

MLA Handbook (7th Edition):

Silva, Shanna Lauda Ferreira da. “A recursividade e seu papel na faculdade da linguagem da espécie humana.” 2014. Web. 09 Apr 2020.

Vancouver:

Silva SLFd. A recursividade e seu papel na faculdade da linguagem da espécie humana. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2014. [cited 2020 Apr 09]. Available from: http://hdl.handle.net/10183/103872.

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

Council of Science Editors:

Silva SLFd. A recursividade e seu papel na faculdade da linguagem da espécie humana. [Thesis]. Universidade do Rio Grande do Sul; 2014. Available from: http://hdl.handle.net/10183/103872

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


Kennesaw State University

26. Yang, Yutong. From Simplest Recursion to the Recursion of Generalizations of Cross Polytope Numbers.

Degree: 2017, Kennesaw State University

  My research project involves investigations in the mathematical field of combinatorics. The research study will be based on the results of Professors Steven Edwards… (more)

Subjects/Keywords: combinatorics; recursion; crosspolytope; number; integer; pascal; Discrete Mathematics and Combinatorics; Number Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, Y. (2017). From Simplest Recursion to the Recursion of Generalizations of Cross Polytope Numbers. (Thesis). Kennesaw State University. Retrieved from https://digitalcommons.kennesaw.edu/honors_etd/13

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):

Yang, Yutong. “From Simplest Recursion to the Recursion of Generalizations of Cross Polytope Numbers.” 2017. Thesis, Kennesaw State University. Accessed April 09, 2020. https://digitalcommons.kennesaw.edu/honors_etd/13.

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

MLA Handbook (7th Edition):

Yang, Yutong. “From Simplest Recursion to the Recursion of Generalizations of Cross Polytope Numbers.” 2017. Web. 09 Apr 2020.

Vancouver:

Yang Y. From Simplest Recursion to the Recursion of Generalizations of Cross Polytope Numbers. [Internet] [Thesis]. Kennesaw State University; 2017. [cited 2020 Apr 09]. Available from: https://digitalcommons.kennesaw.edu/honors_etd/13.

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

Council of Science Editors:

Yang Y. From Simplest Recursion to the Recursion of Generalizations of Cross Polytope Numbers. [Thesis]. Kennesaw State University; 2017. Available from: https://digitalcommons.kennesaw.edu/honors_etd/13

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


University of Edinburgh

27. Brotherston, James. Sequent calculus proof systems for inductive definitions.

Degree: PhD, 2006, University of Edinburgh

 Inductive definitions are the most natural means by which to represent many families of structures occurring in mathematics and computer science, and their corresponding induction… (more)

Subjects/Keywords: 510; induction; recursion; formal proof systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brotherston, J. (2006). Sequent calculus proof systems for inductive definitions. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/1458

Chicago Manual of Style (16th Edition):

Brotherston, James. “Sequent calculus proof systems for inductive definitions.” 2006. Doctoral Dissertation, University of Edinburgh. Accessed April 09, 2020. http://hdl.handle.net/1842/1458.

MLA Handbook (7th Edition):

Brotherston, James. “Sequent calculus proof systems for inductive definitions.” 2006. Web. 09 Apr 2020.

Vancouver:

Brotherston J. Sequent calculus proof systems for inductive definitions. [Internet] [Doctoral dissertation]. University of Edinburgh; 2006. [cited 2020 Apr 09]. Available from: http://hdl.handle.net/1842/1458.

Council of Science Editors:

Brotherston J. Sequent calculus proof systems for inductive definitions. [Doctoral Dissertation]. University of Edinburgh; 2006. Available from: http://hdl.handle.net/1842/1458


NSYSU

28. Ku, Hao-Chung. Experimental study on the measurement of reflection coefficient by Goda method for sloping beach.

Degree: Master, Marine Environment and Engineering, 2014, NSYSU

 In order to apply two-point method (Goda, 1976) on slope, the study in this thesis sets up 14 wave gages on sloping bathymetry in a… (more)

Subjects/Keywords: recursion length; second harmonic wave; incident and reflected waves; shoaling; sloping bathymetry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ku, H. (2014). Experimental study on the measurement of reflection coefficient by Goda method for sloping beach. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823114-154533

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):

Ku, Hao-Chung. “Experimental study on the measurement of reflection coefficient by Goda method for sloping beach.” 2014. Thesis, NSYSU. Accessed April 09, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823114-154533.

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

MLA Handbook (7th Edition):

Ku, Hao-Chung. “Experimental study on the measurement of reflection coefficient by Goda method for sloping beach.” 2014. Web. 09 Apr 2020.

Vancouver:

Ku H. Experimental study on the measurement of reflection coefficient by Goda method for sloping beach. [Internet] [Thesis]. NSYSU; 2014. [cited 2020 Apr 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823114-154533.

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

Council of Science Editors:

Ku H. Experimental study on the measurement of reflection coefficient by Goda method for sloping beach. [Thesis]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823114-154533

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


University of California – Irvine

29. Rin, Benjamin. Mathematical Limits and Philosophical Significance of Transfinite Computation.

Degree: Philosophy, 2014, University of California – Irvine

 The general aim of this thesis is to explore applications of transfinite computation within the philosophy of mathematics|particularly the foundations and philosophy of set theory… (more)

Subjects/Keywords: Logic; Philosophy; Logic; Philosophy of Mathematics; Set Theory; Transfinite Computation; Transfinite Recursion; Turing Machine

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rin, B. (2014). Mathematical Limits and Philosophical Significance of Transfinite Computation. (Thesis). University of California – Irvine. Retrieved from http://www.escholarship.org/uc/item/7cb8m1vc

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):

Rin, Benjamin. “Mathematical Limits and Philosophical Significance of Transfinite Computation.” 2014. Thesis, University of California – Irvine. Accessed April 09, 2020. http://www.escholarship.org/uc/item/7cb8m1vc.

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

MLA Handbook (7th Edition):

Rin, Benjamin. “Mathematical Limits and Philosophical Significance of Transfinite Computation.” 2014. Web. 09 Apr 2020.

Vancouver:

Rin B. Mathematical Limits and Philosophical Significance of Transfinite Computation. [Internet] [Thesis]. University of California – Irvine; 2014. [cited 2020 Apr 09]. Available from: http://www.escholarship.org/uc/item/7cb8m1vc.

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

Council of Science Editors:

Rin B. Mathematical Limits and Philosophical Significance of Transfinite Computation. [Thesis]. University of California – Irvine; 2014. Available from: http://www.escholarship.org/uc/item/7cb8m1vc

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


University of Tasmania

30. Nicholson, Grant. Recursive estimation in time-varying communication systems.

Degree: 1978, University of Tasmania

 This thesis considers applications of minimum mean-square error, recursive estimators to equalization of time-varying digital communication channels. The equalization of the channel is framed as… (more)

Subjects/Keywords: Estimation theory; Least squares; Recursion theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nicholson, G. (1978). Recursive estimation in time-varying communication systems. (Thesis). University of Tasmania. Retrieved from https://eprints.utas.edu.au/21041/1/whole_NicholsonGrant1978_thesis.pdf

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):

Nicholson, Grant. “Recursive estimation in time-varying communication systems.” 1978. Thesis, University of Tasmania. Accessed April 09, 2020. https://eprints.utas.edu.au/21041/1/whole_NicholsonGrant1978_thesis.pdf.

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

MLA Handbook (7th Edition):

Nicholson, Grant. “Recursive estimation in time-varying communication systems.” 1978. Web. 09 Apr 2020.

Vancouver:

Nicholson G. Recursive estimation in time-varying communication systems. [Internet] [Thesis]. University of Tasmania; 1978. [cited 2020 Apr 09]. Available from: https://eprints.utas.edu.au/21041/1/whole_NicholsonGrant1978_thesis.pdf.

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

Council of Science Editors:

Nicholson G. Recursive estimation in time-varying communication systems. [Thesis]. University of Tasmania; 1978. Available from: https://eprints.utas.edu.au/21041/1/whole_NicholsonGrant1978_thesis.pdf

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

[1] [2] [3] [4]

.