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

[1] [2] [3] [4] [5] [6]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


University of Debrecen

1. Molnár, Adrian. Fejezetek az informatika történetéből .

Degree: DE – TEK – Informatikai Kar, 2011, University of Debrecen

A Turing-gép megalkotásának folyamata, annak jellemzése és fontossága az eldönthetőségi probléma terén. Advisors/Committee Members: Terdik, György (advisor).

Subjects/Keywords: automaták, Turing-gép, eldönthetőségi probléma; Alan Turing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Molnár, A. (2011). Fejezetek az informatika történetéből . (Thesis). University of Debrecen. Retrieved from http://hdl.handle.net/2437/105701

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

Molnár, Adrian. “Fejezetek az informatika történetéből .” 2011. Thesis, University of Debrecen. Accessed February 21, 2020. http://hdl.handle.net/2437/105701.

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

MLA Handbook (7th Edition):

Molnár, Adrian. “Fejezetek az informatika történetéből .” 2011. Web. 21 Feb 2020.

Vancouver:

Molnár A. Fejezetek az informatika történetéből . [Internet] [Thesis]. University of Debrecen; 2011. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/2437/105701.

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

Council of Science Editors:

Molnár A. Fejezetek az informatika történetéből . [Thesis]. University of Debrecen; 2011. Available from: http://hdl.handle.net/2437/105701

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

2. Tiago Tavares Madeira, Frederico. O uso de captchas de áudio no combate ao spam em telefonia IP .

Degree: 2011, Universidade Federal de Pernambuco

 Spam é o termo usado para referir-se aos e-mails não solicitados, que geralmente são enviados para um grande número de pessoas, e é hoje considerado… (more)

Subjects/Keywords: SPIT; SPAM; VoIP; CAPTCHA; Turing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tiago Tavares Madeira, F. (2011). O uso de captchas de áudio no combate ao spam em telefonia IP . (Thesis). Universidade Federal de Pernambuco. Retrieved from http://repositorio.ufpe.br/handle/123456789/2676

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

Tiago Tavares Madeira, Frederico. “O uso de captchas de áudio no combate ao spam em telefonia IP .” 2011. Thesis, Universidade Federal de Pernambuco. Accessed February 21, 2020. http://repositorio.ufpe.br/handle/123456789/2676.

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

MLA Handbook (7th Edition):

Tiago Tavares Madeira, Frederico. “O uso de captchas de áudio no combate ao spam em telefonia IP .” 2011. Web. 21 Feb 2020.

Vancouver:

Tiago Tavares Madeira F. O uso de captchas de áudio no combate ao spam em telefonia IP . [Internet] [Thesis]. Universidade Federal de Pernambuco; 2011. [cited 2020 Feb 21]. Available from: http://repositorio.ufpe.br/handle/123456789/2676.

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

Council of Science Editors:

Tiago Tavares Madeira F. O uso de captchas de áudio no combate ao spam em telefonia IP . [Thesis]. Universidade Federal de Pernambuco; 2011. Available from: http://repositorio.ufpe.br/handle/123456789/2676

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


Oregon State University

3. Henry, Calvin Oscar Leon. Computation by a Turing machine carried out in a Minsky post tag formalism.

Degree: MS, Mathematics, 1973, Oregon State University

 This thesis documents a method of proving that Turing machines work for every case, if the construction of the Turing machine is known. Mathematical Induction… (more)

Subjects/Keywords: Turing machines

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Henry, C. O. L. (1973). Computation by a Turing machine carried out in a Minsky post tag formalism. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/44257

Chicago Manual of Style (16th Edition):

Henry, Calvin Oscar Leon. “Computation by a Turing machine carried out in a Minsky post tag formalism.” 1973. Masters Thesis, Oregon State University. Accessed February 21, 2020. http://hdl.handle.net/1957/44257.

MLA Handbook (7th Edition):

Henry, Calvin Oscar Leon. “Computation by a Turing machine carried out in a Minsky post tag formalism.” 1973. Web. 21 Feb 2020.

Vancouver:

Henry COL. Computation by a Turing machine carried out in a Minsky post tag formalism. [Internet] [Masters thesis]. Oregon State University; 1973. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/1957/44257.

Council of Science Editors:

Henry COL. Computation by a Turing machine carried out in a Minsky post tag formalism. [Masters Thesis]. Oregon State University; 1973. Available from: http://hdl.handle.net/1957/44257


Oregon State University

4. Comstock, Dale Robert. An operator scheme for computation with Turing machines.

Degree: PhD, Mathematics, 1967, Oregon State University

An operator scheme for composition of Turing machines is developed and applied to the computation of the recursive functions over an arbitrary alphabet. Advisors/Committee Members: Goheen, H. (advisor).

Subjects/Keywords: Turing machines

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Comstock, D. R. (1967). An operator scheme for computation with Turing machines. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/17207

Chicago Manual of Style (16th Edition):

Comstock, Dale Robert. “An operator scheme for computation with Turing machines.” 1967. Doctoral Dissertation, Oregon State University. Accessed February 21, 2020. http://hdl.handle.net/1957/17207.

MLA Handbook (7th Edition):

Comstock, Dale Robert. “An operator scheme for computation with Turing machines.” 1967. Web. 21 Feb 2020.

Vancouver:

Comstock DR. An operator scheme for computation with Turing machines. [Internet] [Doctoral dissertation]. Oregon State University; 1967. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/1957/17207.

Council of Science Editors:

Comstock DR. An operator scheme for computation with Turing machines. [Doctoral Dissertation]. Oregon State University; 1967. Available from: http://hdl.handle.net/1957/17207


Oregon State University

5. Brady, Allen Harold. Solutions of restricted cases of the halting problem applied to the determination of particular values of a non-computable function.

Degree: PhD, Mathematics, 1964, Oregon State University

See pdf. Advisors/Committee Members: Goheen, Harry E. (advisor).

Subjects/Keywords: Turing machines

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brady, A. H. (1964). Solutions of restricted cases of the halting problem applied to the determination of particular values of a non-computable function. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/17461

Chicago Manual of Style (16th Edition):

Brady, Allen Harold. “Solutions of restricted cases of the halting problem applied to the determination of particular values of a non-computable function.” 1964. Doctoral Dissertation, Oregon State University. Accessed February 21, 2020. http://hdl.handle.net/1957/17461.

MLA Handbook (7th Edition):

Brady, Allen Harold. “Solutions of restricted cases of the halting problem applied to the determination of particular values of a non-computable function.” 1964. Web. 21 Feb 2020.

Vancouver:

Brady AH. Solutions of restricted cases of the halting problem applied to the determination of particular values of a non-computable function. [Internet] [Doctoral dissertation]. Oregon State University; 1964. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/1957/17461.

Council of Science Editors:

Brady AH. Solutions of restricted cases of the halting problem applied to the determination of particular values of a non-computable function. [Doctoral Dissertation]. Oregon State University; 1964. Available from: http://hdl.handle.net/1957/17461


University of Connecticut

6. Turner, Whitney P. Computable Linear Orders and Turing Reductions.

Degree: MS, Mathematics, 2012, University of Connecticut

This thesis explores computable linear orders through Turing Reductions and codes zero jump and zero double jump into linear orders using discrete, dense, and block linear relations. Advisors/Committee Members: Johanna N.Y. Franklin, Henry Towsner, David Reed Solomon.

Subjects/Keywords: Computable; Linear; Order; Turing; Reduction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Turner, W. P. (2012). Computable Linear Orders and Turing Reductions. (Masters Thesis). University of Connecticut. Retrieved from https://opencommons.uconn.edu/gs_theses/246

Chicago Manual of Style (16th Edition):

Turner, Whitney P. “Computable Linear Orders and Turing Reductions.” 2012. Masters Thesis, University of Connecticut. Accessed February 21, 2020. https://opencommons.uconn.edu/gs_theses/246.

MLA Handbook (7th Edition):

Turner, Whitney P. “Computable Linear Orders and Turing Reductions.” 2012. Web. 21 Feb 2020.

Vancouver:

Turner WP. Computable Linear Orders and Turing Reductions. [Internet] [Masters thesis]. University of Connecticut; 2012. [cited 2020 Feb 21]. Available from: https://opencommons.uconn.edu/gs_theses/246.

Council of Science Editors:

Turner WP. Computable Linear Orders and Turing Reductions. [Masters Thesis]. University of Connecticut; 2012. Available from: https://opencommons.uconn.edu/gs_theses/246


University of Ottawa

7. Vinogradova, Polina. Investigating Structure in Turing Categories .

Degree: 2012, University of Ottawa

 The concept of a computable function is quite a well-studied one, however, it is possible to capture certain important properties of computability categorically. A special… (more)

Subjects/Keywords: Turing category; Computable function

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vinogradova, P. (2012). Investigating Structure in Turing Categories . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/20505

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. “Investigating Structure in Turing Categories .” 2012. Thesis, University of Ottawa. Accessed February 21, 2020. http://hdl.handle.net/10393/20505.

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. “Investigating Structure in Turing Categories .” 2012. Web. 21 Feb 2020.

Vancouver:

Vinogradova P. Investigating Structure in Turing Categories . [Internet] [Thesis]. University of Ottawa; 2012. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/10393/20505.

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. Investigating Structure in Turing Categories . [Thesis]. University of Ottawa; 2012. Available from: http://hdl.handle.net/10393/20505

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


Harvard University

8. Hiscock, Thomas. Self-Assembly During Animal Development.

Degree: PhD, 2017, Harvard University

Complex adult tissues develop from single cells during embryonic development. These tissues are formed without instruction from external cues i.e. they are self-assembled. In this… (more)

Subjects/Keywords: development; turing; mathematical model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hiscock, T. (2017). Self-Assembly During Animal Development. (Doctoral Dissertation). Harvard University. Retrieved from http://nrs.harvard.edu/urn-3:HUL.InstRepos:41142067

Chicago Manual of Style (16th Edition):

Hiscock, Thomas. “Self-Assembly During Animal Development.” 2017. Doctoral Dissertation, Harvard University. Accessed February 21, 2020. http://nrs.harvard.edu/urn-3:HUL.InstRepos:41142067.

MLA Handbook (7th Edition):

Hiscock, Thomas. “Self-Assembly During Animal Development.” 2017. Web. 21 Feb 2020.

Vancouver:

Hiscock T. Self-Assembly During Animal Development. [Internet] [Doctoral dissertation]. Harvard University; 2017. [cited 2020 Feb 21]. Available from: http://nrs.harvard.edu/urn-3:HUL.InstRepos:41142067.

Council of Science Editors:

Hiscock T. Self-Assembly During Animal Development. [Doctoral Dissertation]. Harvard University; 2017. Available from: http://nrs.harvard.edu/urn-3:HUL.InstRepos:41142067


Universidade Estadual de Campinas

9. Fernandes, Lucas Dias, 1987-. Padrões de Turing e processos dinâmicos em redes complexas .

Degree: 2012, Universidade Estadual de Campinas

 Resumo: Sistemas de reação-difusão podem apresentar, sob certas condições, formação de padrões espaciais heterogêneos estacionários. Chamados padrões de Turing (ou instabilidades de Turing) devido ao… (more)

Subjects/Keywords: Redes complexas; Padrões de Turing; Dinâmica; Ecologia

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fernandes, Lucas Dias, 1. (2012). Padrões de Turing e processos dinâmicos em redes complexas . (Thesis). Universidade Estadual de Campinas. Retrieved from http://repositorio.unicamp.br/jspui/handle/REPOSIP/278386

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

Fernandes, Lucas Dias, 1987-. “Padrões de Turing e processos dinâmicos em redes complexas .” 2012. Thesis, Universidade Estadual de Campinas. Accessed February 21, 2020. http://repositorio.unicamp.br/jspui/handle/REPOSIP/278386.

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

MLA Handbook (7th Edition):

Fernandes, Lucas Dias, 1987-. “Padrões de Turing e processos dinâmicos em redes complexas .” 2012. Web. 21 Feb 2020.

Vancouver:

Fernandes, Lucas Dias 1. Padrões de Turing e processos dinâmicos em redes complexas . [Internet] [Thesis]. Universidade Estadual de Campinas; 2012. [cited 2020 Feb 21]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/278386.

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

Council of Science Editors:

Fernandes, Lucas Dias 1. Padrões de Turing e processos dinâmicos em redes complexas . [Thesis]. Universidade Estadual de Campinas; 2012. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/278386

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


Victoria University of Wellington

10. Arthur, Katie. Maximality in the ⍺-C.A. Degrees.

Degree: 2016, Victoria University of Wellington

 In [4], Downey and Greenberg define the notion of totally ⍺-c.a. for appropriately small ordinals ⍺, and discuss the hierarchy this notion begets on the… (more)

Subjects/Keywords: Computability; Priority arguments; Permitting; Turing degrees

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arthur, K. (2016). Maximality in the ⍺-C.A. Degrees. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/5183

Chicago Manual of Style (16th Edition):

Arthur, Katie. “Maximality in the ⍺-C.A. Degrees.” 2016. Masters Thesis, Victoria University of Wellington. Accessed February 21, 2020. http://hdl.handle.net/10063/5183.

MLA Handbook (7th Edition):

Arthur, Katie. “Maximality in the ⍺-C.A. Degrees.” 2016. Web. 21 Feb 2020.

Vancouver:

Arthur K. Maximality in the ⍺-C.A. Degrees. [Internet] [Masters thesis]. Victoria University of Wellington; 2016. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/10063/5183.

Council of Science Editors:

Arthur K. Maximality in the ⍺-C.A. Degrees. [Masters Thesis]. Victoria University of Wellington; 2016. Available from: http://hdl.handle.net/10063/5183


Penn State University

11. Wang, Yan. OBFUSCATION WITH TURING MACHINE.

Degree: 2017, Penn State University

 Obfuscation is an important technique to protect software from adversary analysis. Control flow obfuscation effectively prevents attackers from understanding the program structure, hence impeding a… (more)

Subjects/Keywords: Software Security; Control Flow Obfuscation; Turing Machine

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, Y. (2017). OBFUSCATION WITH TURING MACHINE. (Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/13994ybw5084

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

Wang, Yan. “OBFUSCATION WITH TURING MACHINE.” 2017. Thesis, Penn State University. Accessed February 21, 2020. https://etda.libraries.psu.edu/catalog/13994ybw5084.

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

MLA Handbook (7th Edition):

Wang, Yan. “OBFUSCATION WITH TURING MACHINE.” 2017. Web. 21 Feb 2020.

Vancouver:

Wang Y. OBFUSCATION WITH TURING MACHINE. [Internet] [Thesis]. Penn State University; 2017. [cited 2020 Feb 21]. Available from: https://etda.libraries.psu.edu/catalog/13994ybw5084.

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

Council of Science Editors:

Wang Y. OBFUSCATION WITH TURING MACHINE. [Thesis]. Penn State University; 2017. Available from: https://etda.libraries.psu.edu/catalog/13994ybw5084

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


Kansas State University

12. Donnoe, Joshua. Compiling Java in linear nondeterministic space.

Degree: MS, Department of Computer Science, 2018, Kansas State University

 Shannon’s and Chomsky’s attempts to model natural language with Markov chains showed differing gauges of language complexity. These were codified with the Chomsky Hierarchy with… (more)

Subjects/Keywords: Computability; Compilation; Turing; Automata; Context; Sensitivity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Donnoe, J. (2018). Compiling Java in linear nondeterministic space. (Masters Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/38879

Chicago Manual of Style (16th Edition):

Donnoe, Joshua. “Compiling Java in linear nondeterministic space.” 2018. Masters Thesis, Kansas State University. Accessed February 21, 2020. http://hdl.handle.net/2097/38879.

MLA Handbook (7th Edition):

Donnoe, Joshua. “Compiling Java in linear nondeterministic space.” 2018. Web. 21 Feb 2020.

Vancouver:

Donnoe J. Compiling Java in linear nondeterministic space. [Internet] [Masters thesis]. Kansas State University; 2018. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/2097/38879.

Council of Science Editors:

Donnoe J. Compiling Java in linear nondeterministic space. [Masters Thesis]. Kansas State University; 2018. Available from: http://hdl.handle.net/2097/38879


Victoria University of Wellington

13. Kvizhinadze, Giorgi. Large Number of Rare Events: Diversity Analysis in Multiple Choice Questionnaires and Related Topics.

Degree: 2010, Victoria University of Wellington

 The statistical analysis of a large number of rare events, (LNRE), which can also be called statistical theory of diversity, is the subject of acute… (more)

Subjects/Keywords: Statistical theory; Good-turing indices; Diversity; LNRE

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kvizhinadze, G. (2010). Large Number of Rare Events: Diversity Analysis in Multiple Choice Questionnaires and Related Topics. (Doctoral Dissertation). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/1334

Chicago Manual of Style (16th Edition):

Kvizhinadze, Giorgi. “Large Number of Rare Events: Diversity Analysis in Multiple Choice Questionnaires and Related Topics.” 2010. Doctoral Dissertation, Victoria University of Wellington. Accessed February 21, 2020. http://hdl.handle.net/10063/1334.

MLA Handbook (7th Edition):

Kvizhinadze, Giorgi. “Large Number of Rare Events: Diversity Analysis in Multiple Choice Questionnaires and Related Topics.” 2010. Web. 21 Feb 2020.

Vancouver:

Kvizhinadze G. Large Number of Rare Events: Diversity Analysis in Multiple Choice Questionnaires and Related Topics. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 2010. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/10063/1334.

Council of Science Editors:

Kvizhinadze G. Large Number of Rare Events: Diversity Analysis in Multiple Choice Questionnaires and Related Topics. [Doctoral Dissertation]. Victoria University of Wellington; 2010. Available from: http://hdl.handle.net/10063/1334


University of New South Wales

14. Walsh, James. The Relationship between Cell Shape and Division Plane: Control of Prokaryotic Cell Division by Turing Pattern.

Degree: Physics, 2017, University of New South Wales

 Cell division requires the precise placement of the division ring at mid-cell to ensure both daughter cells areviable. However, the mechanisms behind this localization remain… (more)

Subjects/Keywords: Min Protein System; Cell Division; Turing Patterns

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Walsh, J. (2017). The Relationship between Cell Shape and Division Plane: Control of Prokaryotic Cell Division by Turing Pattern. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/58830 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:47695/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Walsh, James. “The Relationship between Cell Shape and Division Plane: Control of Prokaryotic Cell Division by Turing Pattern.” 2017. Doctoral Dissertation, University of New South Wales. Accessed February 21, 2020. http://handle.unsw.edu.au/1959.4/58830 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:47695/SOURCE02?view=true.

MLA Handbook (7th Edition):

Walsh, James. “The Relationship between Cell Shape and Division Plane: Control of Prokaryotic Cell Division by Turing Pattern.” 2017. Web. 21 Feb 2020.

Vancouver:

Walsh J. The Relationship between Cell Shape and Division Plane: Control of Prokaryotic Cell Division by Turing Pattern. [Internet] [Doctoral dissertation]. University of New South Wales; 2017. [cited 2020 Feb 21]. Available from: http://handle.unsw.edu.au/1959.4/58830 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:47695/SOURCE02?view=true.

Council of Science Editors:

Walsh J. The Relationship between Cell Shape and Division Plane: Control of Prokaryotic Cell Division by Turing Pattern. [Doctoral Dissertation]. University of New South Wales; 2017. Available from: http://handle.unsw.edu.au/1959.4/58830 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:47695/SOURCE02?view=true

15. Salinas Molina, Miguel Angel. Computabilidad y máquina de Turing.

Degree: 2011, National University of San Marcos

 La presente investigación evalúa el concepto de computabilidad en la teoría de Alan Turing, justificándose por la existencia de opiniones divergentes entre diversos académicos, expresadas… (more)

Subjects/Keywords: Complejidad computacional; Máquinas de Turing; Funciones computables

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Salinas Molina, M. A. (2011). Computabilidad y máquina de Turing. (Thesis). National University of San Marcos. Retrieved from http://cybertesis.unmsm.edu.pe/handle/cybertesis/3101

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

Salinas Molina, Miguel Angel. “Computabilidad y máquina de Turing.” 2011. Thesis, National University of San Marcos. Accessed February 21, 2020. http://cybertesis.unmsm.edu.pe/handle/cybertesis/3101.

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

MLA Handbook (7th Edition):

Salinas Molina, Miguel Angel. “Computabilidad y máquina de Turing.” 2011. Web. 21 Feb 2020.

Vancouver:

Salinas Molina MA. Computabilidad y máquina de Turing. [Internet] [Thesis]. National University of San Marcos; 2011. [cited 2020 Feb 21]. Available from: http://cybertesis.unmsm.edu.pe/handle/cybertesis/3101.

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

Council of Science Editors:

Salinas Molina MA. Computabilidad y máquina de Turing. [Thesis]. National University of San Marcos; 2011. Available from: http://cybertesis.unmsm.edu.pe/handle/cybertesis/3101

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


Université Montpellier II

16. Givors, Fabien. Vers une structure fine des calculabilités : Towards a fine structure of computabilities.

Degree: Docteur es, Informatique, 2013, Université Montpellier II

La calculabilité est centrée autour de la notion de fonction calculable telle que définie par Church, Kleene, Rosser et Turing au siècle dernier. D'abord focalisée… (more)

Subjects/Keywords: Degrés Turing; Calculabilité; Logique; Récursivité; Sous-Récursion; Turing degrees; Computability; Logic; Recursivity; Subrecursion

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Givors, F. (2013). Vers une structure fine des calculabilités : Towards a fine structure of computabilities. (Doctoral Dissertation). Université Montpellier II. Retrieved from http://www.theses.fr/2013MON20160

Chicago Manual of Style (16th Edition):

Givors, Fabien. “Vers une structure fine des calculabilités : Towards a fine structure of computabilities.” 2013. Doctoral Dissertation, Université Montpellier II. Accessed February 21, 2020. http://www.theses.fr/2013MON20160.

MLA Handbook (7th Edition):

Givors, Fabien. “Vers une structure fine des calculabilités : Towards a fine structure of computabilities.” 2013. Web. 21 Feb 2020.

Vancouver:

Givors F. Vers une structure fine des calculabilités : Towards a fine structure of computabilities. [Internet] [Doctoral dissertation]. Université Montpellier II; 2013. [cited 2020 Feb 21]. Available from: http://www.theses.fr/2013MON20160.

Council of Science Editors:

Givors F. Vers une structure fine des calculabilités : Towards a fine structure of computabilities. [Doctoral Dissertation]. Université Montpellier II; 2013. Available from: http://www.theses.fr/2013MON20160


California State University – Channel Islands

17. Zhang, Hang. Turing Machine Simulator and its Underlying Mechanism .

Degree: 2019, California State University – Channel Islands

Turing machines(TMs) are mathematical models of computation that define abstract machines. Because of their simplicity and consistency, they are amenable to mathematical analysis. These hypothetical… (more)

Subjects/Keywords: Turing Machine Simulator; Universal Turing Machine; General Recursive Function; Lambda Calculus; Computer Science thesis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, H. (2019). Turing Machine Simulator and its Underlying Mechanism . (Thesis). California State University – Channel Islands. Retrieved from http://hdl.handle.net/10211.3/214546

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

Zhang, Hang. “Turing Machine Simulator and its Underlying Mechanism .” 2019. Thesis, California State University – Channel Islands. Accessed February 21, 2020. http://hdl.handle.net/10211.3/214546.

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

MLA Handbook (7th Edition):

Zhang, Hang. “Turing Machine Simulator and its Underlying Mechanism .” 2019. Web. 21 Feb 2020.

Vancouver:

Zhang H. Turing Machine Simulator and its Underlying Mechanism . [Internet] [Thesis]. California State University – Channel Islands; 2019. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/10211.3/214546.

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

Council of Science Editors:

Zhang H. Turing Machine Simulator and its Underlying Mechanism . [Thesis]. California State University – Channel Islands; 2019. Available from: http://hdl.handle.net/10211.3/214546

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

18. Py, Monica Xavier. Análise da Máquina de Turing Persistente com múltiplas fitas de trabalho.

Degree: 2003, Universidade do Rio Grande do Sul

 Nos últimos 70 anos têm sido apresentadas várias propostas para caracteriza ção da noção intuitiva de computabilidade. O modelo de Computação mais conhecido para expressar… (more)

Subjects/Keywords: Máquinas : Turing : Persistente : Paralela; Teoria : Ciência : Computação; Maquinas : Turing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Py, M. X. (2003). Análise da Máquina de Turing Persistente com múltiplas fitas de trabalho. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/3419

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

Py, Monica Xavier. “Análise da Máquina de Turing Persistente com múltiplas fitas de trabalho.” 2003. Thesis, Universidade do Rio Grande do Sul. Accessed February 21, 2020. http://hdl.handle.net/10183/3419.

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

MLA Handbook (7th Edition):

Py, Monica Xavier. “Análise da Máquina de Turing Persistente com múltiplas fitas de trabalho.” 2003. Web. 21 Feb 2020.

Vancouver:

Py MX. Análise da Máquina de Turing Persistente com múltiplas fitas de trabalho. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2003. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/10183/3419.

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

Council of Science Editors:

Py MX. Análise da Máquina de Turing Persistente com múltiplas fitas de trabalho. [Thesis]. Universidade do Rio Grande do Sul; 2003. Available from: http://hdl.handle.net/10183/3419

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

19. Vanier, Pascal. Pavages : périodicité et complexité calculatoire : Inertia Groups and Jacobian Varieties.

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

Cette thèse est dédiée à l'étude des pavages : des ensembles de coloriages du plan discret respectant des contraintes locales données par un jeu de… (more)

Subjects/Keywords: Pavages; Sous-shifts; Calculabilité; Complexité; Sft; Périodicité; Factorisation; Degrés Turing; Tilings; Subshifts; Computability; Complexity; Sft; Periodicity; Factorization; Turing degree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vanier, P. (2012). Pavages : périodicité et complexité calculatoire : Inertia Groups and Jacobian Varieties. (Doctoral Dissertation). Aix Marseille Université. Retrieved from http://www.theses.fr/2012AIXM4813

Chicago Manual of Style (16th Edition):

Vanier, Pascal. “Pavages : périodicité et complexité calculatoire : Inertia Groups and Jacobian Varieties.” 2012. Doctoral Dissertation, Aix Marseille Université. Accessed February 21, 2020. http://www.theses.fr/2012AIXM4813.

MLA Handbook (7th Edition):

Vanier, Pascal. “Pavages : périodicité et complexité calculatoire : Inertia Groups and Jacobian Varieties.” 2012. Web. 21 Feb 2020.

Vancouver:

Vanier P. Pavages : périodicité et complexité calculatoire : Inertia Groups and Jacobian Varieties. [Internet] [Doctoral dissertation]. Aix Marseille Université 2012. [cited 2020 Feb 21]. Available from: http://www.theses.fr/2012AIXM4813.

Council of Science Editors:

Vanier P. Pavages : périodicité et complexité calculatoire : Inertia Groups and Jacobian Varieties. [Doctoral Dissertation]. Aix Marseille Université 2012. Available from: http://www.theses.fr/2012AIXM4813


University of New South Wales

20. Krebs, Peter R. Turing machines, computers and artificial intelligence.

Degree: Philosophy, 2002, University of New South Wales

 This work investigates some of the issues and consequences for the field of artificial intelligence and cognitive science, which are related to the perceived limits… (more)

Subjects/Keywords: Turing machines; Computers; Artificial intelligence; Philosophy; Church-Turing thesis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Krebs, P. R. (2002). Turing machines, computers and artificial intelligence. (Masters Thesis). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/19053 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:540/SOURCE01?view=true

Chicago Manual of Style (16th Edition):

Krebs, Peter R. “Turing machines, computers and artificial intelligence.” 2002. Masters Thesis, University of New South Wales. Accessed February 21, 2020. http://handle.unsw.edu.au/1959.4/19053 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:540/SOURCE01?view=true.

MLA Handbook (7th Edition):

Krebs, Peter R. “Turing machines, computers and artificial intelligence.” 2002. Web. 21 Feb 2020.

Vancouver:

Krebs PR. Turing machines, computers and artificial intelligence. [Internet] [Masters thesis]. University of New South Wales; 2002. [cited 2020 Feb 21]. Available from: http://handle.unsw.edu.au/1959.4/19053 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:540/SOURCE01?view=true.

Council of Science Editors:

Krebs PR. Turing machines, computers and artificial intelligence. [Masters Thesis]. University of New South Wales; 2002. Available from: http://handle.unsw.edu.au/1959.4/19053 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:540/SOURCE01?view=true


University of Guelph

21. Cleary, Erin. The Scientific Way to Simulate Pattern Formation in Reaction-Diffusion Equations .

Degree: 2013, University of Guelph

 For a uniquely defined subset of phase space, solutions of non-linear, coupled reaction-diffusion equations may converge to heterogeneous steady states, organic in appearance. Hence, many… (more)

Subjects/Keywords: Turing pattern; Finite difference method; Numerical methods; Turing space; Initial data; Schnakenberg model; Gierer-Meinhardt model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cleary, E. (2013). The Scientific Way to Simulate Pattern Formation in Reaction-Diffusion Equations . (Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/6659

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

Cleary, Erin. “The Scientific Way to Simulate Pattern Formation in Reaction-Diffusion Equations .” 2013. Thesis, University of Guelph. Accessed February 21, 2020. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/6659.

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

MLA Handbook (7th Edition):

Cleary, Erin. “The Scientific Way to Simulate Pattern Formation in Reaction-Diffusion Equations .” 2013. Web. 21 Feb 2020.

Vancouver:

Cleary E. The Scientific Way to Simulate Pattern Formation in Reaction-Diffusion Equations . [Internet] [Thesis]. University of Guelph; 2013. [cited 2020 Feb 21]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/6659.

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

Council of Science Editors:

Cleary E. The Scientific Way to Simulate Pattern Formation in Reaction-Diffusion Equations . [Thesis]. University of Guelph; 2013. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/6659

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

22. Torabi, Peyman. Skeletal Animation Optimization Using Mesh Shaders.

Degree: 2019, , Department of Creative Technologies

Background. In this thesis a novel method of skinning a mesh utilizing Nvidia’sTuring Mesh Shader pipeline is presented. Skinning a mesh is often performed… (more)

Subjects/Keywords: Turing Mesh Shaders; Skeletal Animation; Skinning; Turing Mesh Shaders; Skeletal Animation; Skinning.; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Torabi, P. (2019). Skeletal Animation Optimization Using Mesh Shaders. (Thesis). , Department of Creative Technologies. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-18248

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

Torabi, Peyman. “Skeletal Animation Optimization Using Mesh Shaders.” 2019. Thesis, , Department of Creative Technologies. Accessed February 21, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-18248.

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

MLA Handbook (7th Edition):

Torabi, Peyman. “Skeletal Animation Optimization Using Mesh Shaders.” 2019. Web. 21 Feb 2020.

Vancouver:

Torabi P. Skeletal Animation Optimization Using Mesh Shaders. [Internet] [Thesis]. , Department of Creative Technologies; 2019. [cited 2020 Feb 21]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-18248.

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

Council of Science Editors:

Torabi P. Skeletal Animation Optimization Using Mesh Shaders. [Thesis]. , Department of Creative Technologies; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-18248

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

23. Nightingale, Andrew. Reanimating Alan : investigating narrative and science in contemporary poetry.

Degree: PhD, 2013, Anglia Ruskin University

 This practice‐based research is a long creative work about Alan Turing. It consists of a series that includes prose, narrative poems and visual poems. An… (more)

Subjects/Keywords: 821; practice-based; Turing; biography; visual poetry; seriality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nightingale, A. (2013). Reanimating Alan : investigating narrative and science in contemporary poetry. (Doctoral Dissertation). Anglia Ruskin University. Retrieved from http://arro.anglia.ac.uk/295466/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.575426

Chicago Manual of Style (16th Edition):

Nightingale, Andrew. “Reanimating Alan : investigating narrative and science in contemporary poetry.” 2013. Doctoral Dissertation, Anglia Ruskin University. Accessed February 21, 2020. http://arro.anglia.ac.uk/295466/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.575426.

MLA Handbook (7th Edition):

Nightingale, Andrew. “Reanimating Alan : investigating narrative and science in contemporary poetry.” 2013. Web. 21 Feb 2020.

Vancouver:

Nightingale A. Reanimating Alan : investigating narrative and science in contemporary poetry. [Internet] [Doctoral dissertation]. Anglia Ruskin University; 2013. [cited 2020 Feb 21]. Available from: http://arro.anglia.ac.uk/295466/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.575426.

Council of Science Editors:

Nightingale A. Reanimating Alan : investigating narrative and science in contemporary poetry. [Doctoral Dissertation]. Anglia Ruskin University; 2013. Available from: http://arro.anglia.ac.uk/295466/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.575426


Instituto Tecnológico de Aeronáutica

24. Luiz Sérgio Ferreira. Particionamento de máquinas de estado finito síncronas com controle assíncrono visando redução do consumo de potência.

Degree: 2012, Instituto Tecnológico de Aeronáutica

 Sabendo que os sistemas digitais modernos têm evoluído rapidamente nas últimas décadas e que tal fato levou á sistemas mais rápidos, com grande capacidade de… (more)

Subjects/Keywords: Arquitetura; Algoritmos; Sistemas digitais; Projetos; Máquinas de Turing; Engenharia eletrônica

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ferreira, L. S. (2012). Particionamento de máquinas de estado finito síncronas com controle assíncrono visando redução do consumo de potência. (Thesis). Instituto Tecnológico de Aeronáutica. Retrieved from http://www.bd.bibl.ita.br/tde_busca/arquivo.php?codArquivo=2221

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

Ferreira, Luiz Sérgio. “Particionamento de máquinas de estado finito síncronas com controle assíncrono visando redução do consumo de potência.” 2012. Thesis, Instituto Tecnológico de Aeronáutica. Accessed February 21, 2020. http://www.bd.bibl.ita.br/tde_busca/arquivo.php?codArquivo=2221.

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

MLA Handbook (7th Edition):

Ferreira, Luiz Sérgio. “Particionamento de máquinas de estado finito síncronas com controle assíncrono visando redução do consumo de potência.” 2012. Web. 21 Feb 2020.

Vancouver:

Ferreira LS. Particionamento de máquinas de estado finito síncronas com controle assíncrono visando redução do consumo de potência. [Internet] [Thesis]. Instituto Tecnológico de Aeronáutica; 2012. [cited 2020 Feb 21]. Available from: http://www.bd.bibl.ita.br/tde_busca/arquivo.php?codArquivo=2221.

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

Council of Science Editors:

Ferreira LS. Particionamento de máquinas de estado finito síncronas com controle assíncrono visando redução do consumo de potência. [Thesis]. Instituto Tecnológico de Aeronáutica; 2012. Available from: http://www.bd.bibl.ita.br/tde_busca/arquivo.php?codArquivo=2221

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

25. Almeida, João Paulo da Cruz [UNESP]. Indução finita, deduções e máquina de Turing.

Degree: 2017, Universidade Estadual Paulista

Este trabalho apresenta uma proposta relacionada ao ensino e prática do pensamento dedutivo formal em Matemática. São apresentados no âmbito do conjunto dos números Naturais… (more)

Subjects/Keywords: Números naturais; Axiomas de peano; Indução; Primeiro elemento dos naturais; Máquinas de Turing; Tese de Turing-Church; Natural numbers; Peano's axioms; Induction; The first natural element; Turing machines; Turing-Church thesis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Almeida, J. P. d. C. [. (2017). Indução finita, deduções e máquina de Turing. (Thesis). Universidade Estadual Paulista. Retrieved from http://hdl.handle.net/11449/151718

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

Almeida, João Paulo da Cruz [UNESP]. “Indução finita, deduções e máquina de Turing.” 2017. Thesis, Universidade Estadual Paulista. Accessed February 21, 2020. http://hdl.handle.net/11449/151718.

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

MLA Handbook (7th Edition):

Almeida, João Paulo da Cruz [UNESP]. “Indução finita, deduções e máquina de Turing.” 2017. Web. 21 Feb 2020.

Vancouver:

Almeida JPdC[. Indução finita, deduções e máquina de Turing. [Internet] [Thesis]. Universidade Estadual Paulista; 2017. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/11449/151718.

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

Council of Science Editors:

Almeida JPdC[. Indução finita, deduções e máquina de Turing. [Thesis]. Universidade Estadual Paulista; 2017. Available from: http://hdl.handle.net/11449/151718

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


Universidade Estadual de Campinas

26. Martins, Michel Faleiros, 1987-. O décimo problema de Hilbert revisitado .

Degree: 2018, Universidade Estadual de Campinas

 Resumo: Nesta dissertação revisitamos a solução do Décimo Problema de Hilbert publicada por Martin Davis. A ideia é apresentar de forma compreensível os pontos principais… (more)

Subjects/Keywords: Turing, Máquinas de; Algoritmos; Equações diofantinas; Teoria dos números; Funções recursivas

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Martins, Michel Faleiros, 1. (2018). O décimo problema de Hilbert revisitado . (Thesis). Universidade Estadual de Campinas. Retrieved from http://repositorio.unicamp.br/jspui/handle/REPOSIP/331515

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

Martins, Michel Faleiros, 1987-. “O décimo problema de Hilbert revisitado .” 2018. Thesis, Universidade Estadual de Campinas. Accessed February 21, 2020. http://repositorio.unicamp.br/jspui/handle/REPOSIP/331515.

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

MLA Handbook (7th Edition):

Martins, Michel Faleiros, 1987-. “O décimo problema de Hilbert revisitado .” 2018. Web. 21 Feb 2020.

Vancouver:

Martins, Michel Faleiros 1. O décimo problema de Hilbert revisitado . [Internet] [Thesis]. Universidade Estadual de Campinas; 2018. [cited 2020 Feb 21]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/331515.

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

Council of Science Editors:

Martins, Michel Faleiros 1. O décimo problema de Hilbert revisitado . [Thesis]. Universidade Estadual de Campinas; 2018. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/331515

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


Rochester Institute of Technology

27. Bryce, Alex. Turing instability in discrete replicator systems.

Degree: School of Mathematical Sciences (COS), 2011, Rochester Institute of Technology

 When analyzing a discrete reaction-diffusion dynamical system, one primary area of interest is locating where in the parameter space Turing instabilities occur. It will be… (more)

Subjects/Keywords: Biomathematics; Dynamical systems; Mathematical biology; Population dynamics; Turing instability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bryce, A. (2011). Turing instability in discrete replicator systems. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/4808

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

Bryce, Alex. “Turing instability in discrete replicator systems.” 2011. Thesis, Rochester Institute of Technology. Accessed February 21, 2020. https://scholarworks.rit.edu/theses/4808.

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

MLA Handbook (7th Edition):

Bryce, Alex. “Turing instability in discrete replicator systems.” 2011. Web. 21 Feb 2020.

Vancouver:

Bryce A. Turing instability in discrete replicator systems. [Internet] [Thesis]. Rochester Institute of Technology; 2011. [cited 2020 Feb 21]. Available from: https://scholarworks.rit.edu/theses/4808.

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

Council of Science Editors:

Bryce A. Turing instability in discrete replicator systems. [Thesis]. Rochester Institute of Technology; 2011. Available from: https://scholarworks.rit.edu/theses/4808

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

28. Nightingale, Andrew. Reanimating Alan : investigating narrative and science in contemporary poetry.

Degree: 2013, Anglia Ruskin University

 This practice‐based research is a long creative work about Alan Turing. It consists of a series that includes prose, narrative poems and visual poems. An… (more)

Subjects/Keywords: 821; practice-based; Turing; biography; visual poetry; seriality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nightingale, A. (2013). Reanimating Alan : investigating narrative and science in contemporary poetry. (Doctoral Dissertation). Anglia Ruskin University. Retrieved from http://hdl.handle.net/10540/295466

Chicago Manual of Style (16th Edition):

Nightingale, Andrew. “Reanimating Alan : investigating narrative and science in contemporary poetry.” 2013. Doctoral Dissertation, Anglia Ruskin University. Accessed February 21, 2020. http://hdl.handle.net/10540/295466.

MLA Handbook (7th Edition):

Nightingale, Andrew. “Reanimating Alan : investigating narrative and science in contemporary poetry.” 2013. Web. 21 Feb 2020.

Vancouver:

Nightingale A. Reanimating Alan : investigating narrative and science in contemporary poetry. [Internet] [Doctoral dissertation]. Anglia Ruskin University; 2013. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/10540/295466.

Council of Science Editors:

Nightingale A. Reanimating Alan : investigating narrative and science in contemporary poetry. [Doctoral Dissertation]. Anglia Ruskin University; 2013. Available from: http://hdl.handle.net/10540/295466


University of California – San Diego

29. Suresh, Ananda Theertha. Statistical Inference over Large Domains.

Degree: Electrical Engineering (Communication Theory and Systems), 2016, University of California – San Diego

 Motivated by diverse applications in ecology, genetics, and language modeling, researchers in learning, computer science, and information theory have recently studied several fundamental statistical questions… (more)

Subjects/Keywords: Electrical engineering; Information science; Good-Turing estimators; Large Domain; Statistical Inference

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Suresh, A. T. (2016). Statistical Inference over Large Domains. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/6vr8w9bq

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

Suresh, Ananda Theertha. “Statistical Inference over Large Domains.” 2016. Thesis, University of California – San Diego. Accessed February 21, 2020. http://www.escholarship.org/uc/item/6vr8w9bq.

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

MLA Handbook (7th Edition):

Suresh, Ananda Theertha. “Statistical Inference over Large Domains.” 2016. Web. 21 Feb 2020.

Vancouver:

Suresh AT. Statistical Inference over Large Domains. [Internet] [Thesis]. University of California – San Diego; 2016. [cited 2020 Feb 21]. Available from: http://www.escholarship.org/uc/item/6vr8w9bq.

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

Council of Science Editors:

Suresh AT. Statistical Inference over Large Domains. [Thesis]. University of California – San Diego; 2016. Available from: http://www.escholarship.org/uc/item/6vr8w9bq

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


McMaster University

30. Herman, Grzegorz. Unambiguous Functions in Logarithmic Space.

Degree: PhD, 2009, McMaster University

The notion of nondeterminism is one of the most fundamental concepts in many areas of computer science. Unambiguity, requiring that there be at most… (more)

Subjects/Keywords: unambiguity; space-bound; Turing; logarithmic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Herman, G. (2009). Unambiguous Functions in Logarithmic Space. (Doctoral Dissertation). McMaster University. Retrieved from http://hdl.handle.net/11375/17309

Chicago Manual of Style (16th Edition):

Herman, Grzegorz. “Unambiguous Functions in Logarithmic Space.” 2009. Doctoral Dissertation, McMaster University. Accessed February 21, 2020. http://hdl.handle.net/11375/17309.

MLA Handbook (7th Edition):

Herman, Grzegorz. “Unambiguous Functions in Logarithmic Space.” 2009. Web. 21 Feb 2020.

Vancouver:

Herman G. Unambiguous Functions in Logarithmic Space. [Internet] [Doctoral dissertation]. McMaster University; 2009. [cited 2020 Feb 21]. Available from: http://hdl.handle.net/11375/17309.

Council of Science Editors:

Herman G. Unambiguous Functions in Logarithmic Space. [Doctoral Dissertation]. McMaster University; 2009. Available from: http://hdl.handle.net/11375/17309

[1] [2] [3] [4] [5] [6]

.