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 Machine). Showing records 1 – 30 of 34 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

Languages

Country

▼ Search Limiters


Penn State University

1. 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://submit-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 November 29, 2020. https://submit-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. 29 Nov 2020.

Vancouver:

Wang Y. OBFUSCATION WITH TURING MACHINE. [Internet] [Thesis]. Penn State University; 2017. [cited 2020 Nov 29]. Available from: https://submit-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://submit-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


University of California – Irvine

2. 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 November 29, 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. 29 Nov 2020.

Vancouver:

Rin B. Mathematical Limits and Philosophical Significance of Transfinite Computation. [Internet] [Thesis]. University of California – Irvine; 2014. [cited 2020 Nov 29]. 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 Michigan

3. Hui, Dennis. Asymptotic performance and complexity of quantization.

Degree: PhD, Systems science, 1998, University of Michigan

 The classical theory of lossy source coding focuses on the performance, in terms of rate and distortion, of quantization. However, there is little understanding of… (more)

Subjects/Keywords: Asymptotic; Complexity; Performance; Quantization; Turing Machine

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hui, D. (1998). Asymptotic performance and complexity of quantization. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/130998

Chicago Manual of Style (16th Edition):

Hui, Dennis. “Asymptotic performance and complexity of quantization.” 1998. Doctoral Dissertation, University of Michigan. Accessed November 29, 2020. http://hdl.handle.net/2027.42/130998.

MLA Handbook (7th Edition):

Hui, Dennis. “Asymptotic performance and complexity of quantization.” 1998. Web. 29 Nov 2020.

Vancouver:

Hui D. Asymptotic performance and complexity of quantization. [Internet] [Doctoral dissertation]. University of Michigan; 1998. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/2027.42/130998.

Council of Science Editors:

Hui D. Asymptotic performance and complexity of quantization. [Doctoral Dissertation]. University of Michigan; 1998. Available from: http://hdl.handle.net/2027.42/130998

4. Rendell, Paul. Turing machine universality of the game of life.

Degree: PhD, 2014, University of the West of England, Bristol

 This project proves universal computation in the Game of Life cellular automaton by using a Turing machine construction. Existing proofs of universality in the Game… (more)

Subjects/Keywords: 004.01; turing machine; cellular automata; conway's game of life; quadratic assignment problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rendell, P. (2014). Turing machine universality of the game of life. (Doctoral Dissertation). University of the West of England, Bristol. Retrieved from https://uwe-repository.worktribe.com/output/822575 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.589121

Chicago Manual of Style (16th Edition):

Rendell, Paul. “Turing machine universality of the game of life.” 2014. Doctoral Dissertation, University of the West of England, Bristol. Accessed November 29, 2020. https://uwe-repository.worktribe.com/output/822575 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.589121.

MLA Handbook (7th Edition):

Rendell, Paul. “Turing machine universality of the game of life.” 2014. Web. 29 Nov 2020.

Vancouver:

Rendell P. Turing machine universality of the game of life. [Internet] [Doctoral dissertation]. University of the West of England, Bristol; 2014. [cited 2020 Nov 29]. Available from: https://uwe-repository.worktribe.com/output/822575 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.589121.

Council of Science Editors:

Rendell P. Turing machine universality of the game of life. [Doctoral Dissertation]. University of the West of England, Bristol; 2014. Available from: https://uwe-repository.worktribe.com/output/822575 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.589121


University of Colorado

5. Moore, Matthew Dale. The Undecidability of the Definability of Principal Subcongruences.

Degree: PhD, Mathematics, 2013, University of Colorado

  For each Turing machine T, we construct an algebra A'(T) such that the variety generated by A'(T) has definable principal subcongruences if and only… (more)

Subjects/Keywords: definable principal subcongruences; Turing machine; undecidable; Computer Sciences; Logic and Foundations; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moore, M. D. (2013). The Undecidability of the Definability of Principal Subcongruences. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/esbm_gradetds/2

Chicago Manual of Style (16th Edition):

Moore, Matthew Dale. “The Undecidability of the Definability of Principal Subcongruences.” 2013. Doctoral Dissertation, University of Colorado. Accessed November 29, 2020. https://scholar.colorado.edu/esbm_gradetds/2.

MLA Handbook (7th Edition):

Moore, Matthew Dale. “The Undecidability of the Definability of Principal Subcongruences.” 2013. Web. 29 Nov 2020.

Vancouver:

Moore MD. The Undecidability of the Definability of Principal Subcongruences. [Internet] [Doctoral dissertation]. University of Colorado; 2013. [cited 2020 Nov 29]. Available from: https://scholar.colorado.edu/esbm_gradetds/2.

Council of Science Editors:

Moore MD. The Undecidability of the Definability of Principal Subcongruences. [Doctoral Dissertation]. University of Colorado; 2013. Available from: https://scholar.colorado.edu/esbm_gradetds/2


Simon Fraser University

6. Biagioni, Glen. A study of some of the main methods of proof in abstract complexity theory.  – .

Degree: 1974, Simon Fraser University

Subjects/Keywords: Turing machines.; Machine theory.; Recursive functions.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Biagioni, G. (1974). A study of some of the main methods of proof in abstract complexity theory.  – . (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/3387

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

Biagioni, Glen. “A study of some of the main methods of proof in abstract complexity theory.  – .” 1974. Thesis, Simon Fraser University. Accessed November 29, 2020. http://summit.sfu.ca/item/3387.

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

MLA Handbook (7th Edition):

Biagioni, Glen. “A study of some of the main methods of proof in abstract complexity theory.  – .” 1974. Web. 29 Nov 2020.

Vancouver:

Biagioni G. A study of some of the main methods of proof in abstract complexity theory.  – . [Internet] [Thesis]. Simon Fraser University; 1974. [cited 2020 Nov 29]. Available from: http://summit.sfu.ca/item/3387.

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

Council of Science Editors:

Biagioni G. A study of some of the main methods of proof in abstract complexity theory.  – . [Thesis]. Simon Fraser University; 1974. Available from: http://summit.sfu.ca/item/3387

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

7. da Cunha, Aubrey. Turing Machines, Cayley Graphs, and Inescapable Groups.

Degree: PhD, Mathematics, 2012, University of Michigan

 We present a generalization of standard Turing machines based on allowing unusual tapes. We present a set of reasonable constraints on tape geometry and conclude… (more)

Subjects/Keywords: Turing Machine; Cayley Graph; Turing Degree; Computability; Mathematics; Science

…their neighbors to perform a computation. Time use on a Turing machine with a d-dimensional… …powerful than standard Turing machines. In fact, they can be as powerful as any oracle machine… …and we end up with an alternative definition of the Turing degrees that is machine based and… …them could be referenced by the transition table anyway. 5. Backtracking - The Turing machine… …the branches and since a Turing machine can easily detect whether a cell has a branch, we… 

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

da Cunha, A. (2012). Turing Machines, Cayley Graphs, and Inescapable Groups. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/94057

Chicago Manual of Style (16th Edition):

da Cunha, Aubrey. “Turing Machines, Cayley Graphs, and Inescapable Groups.” 2012. Doctoral Dissertation, University of Michigan. Accessed November 29, 2020. http://hdl.handle.net/2027.42/94057.

MLA Handbook (7th Edition):

da Cunha, Aubrey. “Turing Machines, Cayley Graphs, and Inescapable Groups.” 2012. Web. 29 Nov 2020.

Vancouver:

da Cunha A. Turing Machines, Cayley Graphs, and Inescapable Groups. [Internet] [Doctoral dissertation]. University of Michigan; 2012. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/2027.42/94057.

Council of Science Editors:

da Cunha A. Turing Machines, Cayley Graphs, and Inescapable Groups. [Doctoral Dissertation]. University of Michigan; 2012. Available from: http://hdl.handle.net/2027.42/94057


Texas A&M University

8. Flagg, Mary Soviak. A Lindenmayer-system.

Degree: MS, mathematics, 2012, Texas A&M University

Subjects/Keywords: mathematics.; Major mathematics.; Turing machines.; L systems.; Machine theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Flagg, M. S. (2012). A Lindenmayer-system. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1978-THESIS-F574

Chicago Manual of Style (16th Edition):

Flagg, Mary Soviak. “A Lindenmayer-system.” 2012. Masters Thesis, Texas A&M University. Accessed November 29, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-1978-THESIS-F574.

MLA Handbook (7th Edition):

Flagg, Mary Soviak. “A Lindenmayer-system.” 2012. Web. 29 Nov 2020.

Vancouver:

Flagg MS. A Lindenmayer-system. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1978-THESIS-F574.

Council of Science Editors:

Flagg MS. A Lindenmayer-system. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1978-THESIS-F574


Brno University of Technology

9. Krajíček, Karel. Universální simulátor automatů: A Universal Automata Simulator.

Degree: 2020, Brno University of Technology

 This paper is about simulator of automata, where user can work with different types of automata and Turing machines. For that was created program in… (more)

Subjects/Keywords: Turingov stroj; Konečné automaty; Zásobníkové automaty; Simulátor automatov; C++; Turing machine; Finite-state automaton; Pushdown automaton; Automata simulator; C++

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Krajíček, K. (2020). Universální simulátor automatů: A Universal Automata Simulator. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/189778

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

Krajíček, Karel. “Universální simulátor automatů: A Universal Automata Simulator.” 2020. Thesis, Brno University of Technology. Accessed November 29, 2020. http://hdl.handle.net/11012/189778.

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

MLA Handbook (7th Edition):

Krajíček, Karel. “Universální simulátor automatů: A Universal Automata Simulator.” 2020. Web. 29 Nov 2020.

Vancouver:

Krajíček K. Universální simulátor automatů: A Universal Automata Simulator. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/11012/189778.

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

Council of Science Editors:

Krajíček K. Universální simulátor automatů: A Universal Automata Simulator. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/189778

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


Brno University of Technology

10. Surovič, Marek. Turingovy stroje bez návratu na pásce: Non-Returning Turing Machines.

Degree: 2018, Brno University of Technology

 This work introduces a restricted variant of the Turing machine which cannot move left, thus return on its tape. Other properties, such as the potentially… (more)

Subjects/Keywords: Turingův stroj; konečný automat; transformace; omezení; vyjadřovací síla; Turing machine; finite automaton; transformation; restriction; expressive power

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Surovič, M. (2018). Turingovy stroje bez návratu na pásce: Non-Returning Turing Machines. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/54874

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

Surovič, Marek. “Turingovy stroje bez návratu na pásce: Non-Returning Turing Machines.” 2018. Thesis, Brno University of Technology. Accessed November 29, 2020. http://hdl.handle.net/11012/54874.

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

MLA Handbook (7th Edition):

Surovič, Marek. “Turingovy stroje bez návratu na pásce: Non-Returning Turing Machines.” 2018. Web. 29 Nov 2020.

Vancouver:

Surovič M. Turingovy stroje bez návratu na pásce: Non-Returning Turing Machines. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/11012/54874.

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

Council of Science Editors:

Surovič M. Turingovy stroje bez návratu na pásce: Non-Returning Turing Machines. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/54874

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


Brno University of Technology

11. Siska, Josef. Simulátor Turingových strojů popsaných pomocí kompozitních diagramů: Simulator of Turing Machines Described by Means of Composite Diagrams.

Degree: 2019, Brno University of Technology

 In this thesis, the theory related to Turing machines and means of their description (with focus on composite diagrams) is presented. The aim of this… (more)

Subjects/Keywords: Turingův stroj; kompozitní diagram; simulace; problém zastavení; fundované uspořádání; Turing machine; composite diagram; simulation; halting problem; well-founded order

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Siska, J. (2019). Simulátor Turingových strojů popsaných pomocí kompozitních diagramů: Simulator of Turing Machines Described by Means of Composite Diagrams. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53343

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

Siska, Josef. “Simulátor Turingových strojů popsaných pomocí kompozitních diagramů: Simulator of Turing Machines Described by Means of Composite Diagrams.” 2019. Thesis, Brno University of Technology. Accessed November 29, 2020. http://hdl.handle.net/11012/53343.

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

MLA Handbook (7th Edition):

Siska, Josef. “Simulátor Turingových strojů popsaných pomocí kompozitních diagramů: Simulator of Turing Machines Described by Means of Composite Diagrams.” 2019. Web. 29 Nov 2020.

Vancouver:

Siska J. Simulátor Turingových strojů popsaných pomocí kompozitních diagramů: Simulator of Turing Machines Described by Means of Composite Diagrams. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/11012/53343.

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

Council of Science Editors:

Siska J. Simulátor Turingových strojů popsaných pomocí kompozitních diagramů: Simulator of Turing Machines Described by Means of Composite Diagrams. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/53343

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


University of Adelaide

12. Lagana, Antonio. Quantum computation and a universal quantum computer.

Degree: 2012, University of Adelaide

 This thesis covers two main topics in quantum computing: universal quantum computation and quantum search. We first demonstrate how a quantum harmonic oscillator can be… (more)

Subjects/Keywords: universal quantum turing machine; programmable quantum computer; oracle based algorithms; quantum search; Grover search; quantum halting problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lagana, A. (2012). Quantum computation and a universal quantum computer. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/77320

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

Lagana, Antonio. “Quantum computation and a universal quantum computer.” 2012. Thesis, University of Adelaide. Accessed November 29, 2020. http://hdl.handle.net/2440/77320.

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

MLA Handbook (7th Edition):

Lagana, Antonio. “Quantum computation and a universal quantum computer.” 2012. Web. 29 Nov 2020.

Vancouver:

Lagana A. Quantum computation and a universal quantum computer. [Internet] [Thesis]. University of Adelaide; 2012. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/2440/77320.

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

Council of Science Editors:

Lagana A. Quantum computation and a universal quantum computer. [Thesis]. University of Adelaide; 2012. Available from: http://hdl.handle.net/2440/77320

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


Brno University of Technology

13. Látal, Pavel. Interaktivni simulace s využitím technologie Flash: Interactive simulation by means of Flash technology.

Degree: 2019, Brno University of Technology

 This bachelor thesis is interested in designing of six interactive simulations by means of Flash technology. The presented interactive simulations are follows: an extended version… (more)

Subjects/Keywords: Flash; ActionScript; celulární automat; selekční principy; mravenčí kolonie; Turingův stroj; Flash; ActionScript; cellular automaton; selection principles; ant colony; Turing machine

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Látal, P. (2019). Interaktivni simulace s využitím technologie Flash: Interactive simulation by means of Flash technology. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/15833

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

Látal, Pavel. “Interaktivni simulace s využitím technologie Flash: Interactive simulation by means of Flash technology.” 2019. Thesis, Brno University of Technology. Accessed November 29, 2020. http://hdl.handle.net/11012/15833.

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

MLA Handbook (7th Edition):

Látal, Pavel. “Interaktivni simulace s využitím technologie Flash: Interactive simulation by means of Flash technology.” 2019. Web. 29 Nov 2020.

Vancouver:

Látal P. Interaktivni simulace s využitím technologie Flash: Interactive simulation by means of Flash technology. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/11012/15833.

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

Council of Science Editors:

Látal P. Interaktivni simulace s využitím technologie Flash: Interactive simulation by means of Flash technology. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/15833

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


Brno University of Technology

14. Krajíček, Karel. Universální simulátor automatů: A Universal Automata Simulator.

Degree: 2020, Brno University of Technology

 This paper is about simulator of automata, where user can work with different types of automata and Turing machines. For that was created program in… (more)

Subjects/Keywords: Turingov stroj; Konečné automaty; Zásobníkové automaty; Simulátor automatov; C++; Turing machine; Finite-state automaton; Pushdown automaton; Automata simulator; C++

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Krajíček, K. (2020). Universální simulátor automatů: A Universal Automata Simulator. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/187212

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

Krajíček, Karel. “Universální simulátor automatů: A Universal Automata Simulator.” 2020. Thesis, Brno University of Technology. Accessed November 29, 2020. http://hdl.handle.net/11012/187212.

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

MLA Handbook (7th Edition):

Krajíček, Karel. “Universální simulátor automatů: A Universal Automata Simulator.” 2020. Web. 29 Nov 2020.

Vancouver:

Krajíček K. Universální simulátor automatů: A Universal Automata Simulator. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/11012/187212.

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

Council of Science Editors:

Krajíček K. Universální simulátor automatů: A Universal Automata Simulator. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/187212

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


University of Illinois – Urbana-Champaign

15. Estrada, Daniel. Rethinking machines: artificial intelligence beyond the philosophy of mind.

Degree: PhD, 0332, 2014, University of Illinois – Urbana-Champaign

 Recent philosophy of mind has increasingly focused on the role of technology in shaping, influencing, and extending our mental faculties. Technology extends the mind in… (more)

Subjects/Keywords: machine participation; philosophy of technology; Alan Turing; artificial intelligence; philosophy of mind; Lady Lovelace; machine autonomy; human computation; network theory; fair play

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Estrada, D. (2014). Rethinking machines: artificial intelligence beyond the philosophy of mind. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/50610

Chicago Manual of Style (16th Edition):

Estrada, Daniel. “Rethinking machines: artificial intelligence beyond the philosophy of mind.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed November 29, 2020. http://hdl.handle.net/2142/50610.

MLA Handbook (7th Edition):

Estrada, Daniel. “Rethinking machines: artificial intelligence beyond the philosophy of mind.” 2014. Web. 29 Nov 2020.

Vancouver:

Estrada D. Rethinking machines: artificial intelligence beyond the philosophy of mind. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/2142/50610.

Council of Science Editors:

Estrada D. Rethinking machines: artificial intelligence beyond the philosophy of mind. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/50610


Brno University of Technology

16. Jancek, Libor. Klasifikace a využití gramatik, jazyků a automatů: Classification and Usage of Languages, Grammars and Machines.

Degree: 2019, Brno University of Technology

 This bachelor thesis is focused on theory of languages, grammars and automats, on showing real examples of linale machine and on creating program for firm… (more)

Subjects/Keywords: Jazyk; abeceda; slovo; gramatika; Chomského hierarchie; automaty; Turingův stroj; konečný automat; jazyk automatu; Kleeneho věta; Pumping lemma; nedeterministický konečný automat; Language; alphabeth; world; grammar; Chomského hierarchy; machine; Turing machine; finale machine; language of machine; Kleene sentence; Pumping lemma; nondeterministic finale machine

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jancek, L. (2019). Klasifikace a využití gramatik, jazyků a automatů: Classification and Usage of Languages, Grammars and Machines. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/15028

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

Jancek, Libor. “Klasifikace a využití gramatik, jazyků a automatů: Classification and Usage of Languages, Grammars and Machines.” 2019. Thesis, Brno University of Technology. Accessed November 29, 2020. http://hdl.handle.net/11012/15028.

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

MLA Handbook (7th Edition):

Jancek, Libor. “Klasifikace a využití gramatik, jazyků a automatů: Classification and Usage of Languages, Grammars and Machines.” 2019. Web. 29 Nov 2020.

Vancouver:

Jancek L. Klasifikace a využití gramatik, jazyků a automatů: Classification and Usage of Languages, Grammars and Machines. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/11012/15028.

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

Council of Science Editors:

Jancek L. Klasifikace a využití gramatik, jazyků a automatů: Classification and Usage of Languages, Grammars and Machines. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/15028

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


Brno University of Technology

17. Řičánek, Michal. Klasifikace a využití jazyků, gramatik a automatů: Classification and Usage of Languages, Grammars and Machines.

Degree: 2018, Brno University of Technology

 The aim of this bachelor thesis is the classification of formal grammars, languages, abstract machines and their ways of use in practice. The first section… (more)

Subjects/Keywords: Formální gramatika; formální jazyk; konečný automat; deterministický konečný automat; nedeterministický konečný automat; Chomského hierarchie; Turingův stroj.; Formal grammar; formal language; finite state machine; deterministic finite state machine; nondeterministic finite state machine; Chomsky hierarchy; Turing machine.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Řičánek, M. (2018). Klasifikace a využití jazyků, gramatik a automatů: Classification and Usage of Languages, Grammars and Machines. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/15025

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

Řičánek, Michal. “Klasifikace a využití jazyků, gramatik a automatů: Classification and Usage of Languages, Grammars and Machines.” 2018. Thesis, Brno University of Technology. Accessed November 29, 2020. http://hdl.handle.net/11012/15025.

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

MLA Handbook (7th Edition):

Řičánek, Michal. “Klasifikace a využití jazyků, gramatik a automatů: Classification and Usage of Languages, Grammars and Machines.” 2018. Web. 29 Nov 2020.

Vancouver:

Řičánek M. Klasifikace a využití jazyků, gramatik a automatů: Classification and Usage of Languages, Grammars and Machines. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/11012/15025.

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

Council of Science Editors:

Řičánek M. Klasifikace a využití jazyků, gramatik a automatů: Classification and Usage of Languages, Grammars and Machines. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/15025

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


California State University – San Bernardino

18. Chen, Yin Fu. SIMTM turing machine simulator.

Degree: MSin Computer Science, School of Computer Science and Engineering, 1995, California State University – San Bernardino

Subjects/Keywords: Sequential machine theory; Turing machines; Electronic digital computers; Computer Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, Y. F. (1995). SIMTM turing machine simulator. (Thesis). California State University – San Bernardino. Retrieved from http://scholarworks.lib.csusb.edu/etd-project/1229

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

Chen, Yin Fu. “SIMTM turing machine simulator.” 1995. Thesis, California State University – San Bernardino. Accessed November 29, 2020. http://scholarworks.lib.csusb.edu/etd-project/1229.

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

MLA Handbook (7th Edition):

Chen, Yin Fu. “SIMTM turing machine simulator.” 1995. Web. 29 Nov 2020.

Vancouver:

Chen YF. SIMTM turing machine simulator. [Internet] [Thesis]. California State University – San Bernardino; 1995. [cited 2020 Nov 29]. Available from: http://scholarworks.lib.csusb.edu/etd-project/1229.

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

Council of Science Editors:

Chen YF. SIMTM turing machine simulator. [Thesis]. California State University – San Bernardino; 1995. Available from: http://scholarworks.lib.csusb.edu/etd-project/1229

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


Universiteit Hasselt

19. GELADE, Wouter. Optimization of XML schema languages: complexity of counting and the shuffle operator.

Degree: 2006, Universiteit Hasselt

Subjects/Keywords: Turing machine; Tiling; regular expressions; tree languages; unranked tree automata

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

GELADE, W. (2006). Optimization of XML schema languages: complexity of counting and the shuffle operator. (Thesis). Universiteit Hasselt. Retrieved from http://hdl.handle.net/1942/1063

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

GELADE, Wouter. “Optimization of XML schema languages: complexity of counting and the shuffle operator.” 2006. Thesis, Universiteit Hasselt. Accessed November 29, 2020. http://hdl.handle.net/1942/1063.

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

MLA Handbook (7th Edition):

GELADE, Wouter. “Optimization of XML schema languages: complexity of counting and the shuffle operator.” 2006. Web. 29 Nov 2020.

Vancouver:

GELADE W. Optimization of XML schema languages: complexity of counting and the shuffle operator. [Internet] [Thesis]. Universiteit Hasselt; 2006. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/1942/1063.

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

Council of Science Editors:

GELADE W. Optimization of XML schema languages: complexity of counting and the shuffle operator. [Thesis]. Universiteit Hasselt; 2006. Available from: http://hdl.handle.net/1942/1063

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


University of Bradford

20. Al-Shihi, Hamda Darwish Ali. A transdisciplinary study of embodiment in HCI, AI and New Media.

Degree: PhD, 2012, University of Bradford

 The aim of this thesis is to report on a transdisciplinary approach, regarding the complexity of thinking about human embodiment in relation to machine embodiment.… (more)

Subjects/Keywords: 004.01; Embodiment; Transdisciplinary; Meta-analysis; Affectivity; Mark Hansen; Gilles Deleuze; Gilbert Simondon; Becoming; Basarab Nicolescu; Alan Turing; Human embodiment; Machine embodiment; Virtual embodiment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Al-Shihi, H. D. A. (2012). A transdisciplinary study of embodiment in HCI, AI and New Media. (Doctoral Dissertation). University of Bradford. Retrieved from http://hdl.handle.net/10454/6330

Chicago Manual of Style (16th Edition):

Al-Shihi, Hamda Darwish Ali. “A transdisciplinary study of embodiment in HCI, AI and New Media.” 2012. Doctoral Dissertation, University of Bradford. Accessed November 29, 2020. http://hdl.handle.net/10454/6330.

MLA Handbook (7th Edition):

Al-Shihi, Hamda Darwish Ali. “A transdisciplinary study of embodiment in HCI, AI and New Media.” 2012. Web. 29 Nov 2020.

Vancouver:

Al-Shihi HDA. A transdisciplinary study of embodiment in HCI, AI and New Media. [Internet] [Doctoral dissertation]. University of Bradford; 2012. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/10454/6330.

Council of Science Editors:

Al-Shihi HDA. A transdisciplinary study of embodiment in HCI, AI and New Media. [Doctoral Dissertation]. University of Bradford; 2012. Available from: http://hdl.handle.net/10454/6330


Brno University of Technology

21. Syrový, Ondřej. Vizualizace práce konečných automatů, zásobníkových automatů a Turingova stroje: Visualization of Finite Automata, Pushdown Automata and Turing Machines Work.

Degree: 2018, Brno University of Technology

 This bachelor`s thesis is focusing on concept and development of computer application for demonstration of finite automata, pushdown automata and Turing machines work. Theoretic volume… (more)

Subjects/Keywords: Konečný automat; zásobníkový automat; Turingův stroj; demonstrace; determinizmus; simulace; formální jazyk; gramatika; teorie automatů; wxWidgets; Finite automata; pushdown automata; Turing machine; demonstration; determinism; simulation; formal language; grammar; automata theory; wxWidgets

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Syrový, O. (2018). Vizualizace práce konečných automatů, zásobníkových automatů a Turingova stroje: Visualization of Finite Automata, Pushdown Automata and Turing Machines Work. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/54435

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

Syrový, Ondřej. “Vizualizace práce konečných automatů, zásobníkových automatů a Turingova stroje: Visualization of Finite Automata, Pushdown Automata and Turing Machines Work.” 2018. Thesis, Brno University of Technology. Accessed November 29, 2020. http://hdl.handle.net/11012/54435.

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

MLA Handbook (7th Edition):

Syrový, Ondřej. “Vizualizace práce konečných automatů, zásobníkových automatů a Turingova stroje: Visualization of Finite Automata, Pushdown Automata and Turing Machines Work.” 2018. Web. 29 Nov 2020.

Vancouver:

Syrový O. Vizualizace práce konečných automatů, zásobníkových automatů a Turingova stroje: Visualization of Finite Automata, Pushdown Automata and Turing Machines Work. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/11012/54435.

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

Council of Science Editors:

Syrový O. Vizualizace práce konečných automatů, zásobníkových automatů a Turingova stroje: Visualization of Finite Automata, Pushdown Automata and Turing Machines Work. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/54435

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


Texas Tech University

22. Garcia, Eric N. A Non-Recursive Universal Quantum Turing Machine Simulation in SequenceL with a Post-Selection Halting Scheme.

Degree: Computer Science, 2010, Texas Tech University

 Many quantum programming languages have been recently introduced to create a new tool for expressing quantum algorithms. However, many have failed to formally express themselves… (more)

Subjects/Keywords: Quantum turing machine; Universal; Recursion; SequenceL (Computer program language); Post selection; Halting scheme

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Garcia, E. N. (2010). A Non-Recursive Universal Quantum Turing Machine Simulation in SequenceL with a Post-Selection Halting Scheme. (Thesis). Texas Tech University. Retrieved from http://hdl.handle.net/2346/ETD-TTU-2010-12-1258

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

Garcia, Eric N. “A Non-Recursive Universal Quantum Turing Machine Simulation in SequenceL with a Post-Selection Halting Scheme.” 2010. Thesis, Texas Tech University. Accessed November 29, 2020. http://hdl.handle.net/2346/ETD-TTU-2010-12-1258.

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

MLA Handbook (7th Edition):

Garcia, Eric N. “A Non-Recursive Universal Quantum Turing Machine Simulation in SequenceL with a Post-Selection Halting Scheme.” 2010. Web. 29 Nov 2020.

Vancouver:

Garcia EN. A Non-Recursive Universal Quantum Turing Machine Simulation in SequenceL with a Post-Selection Halting Scheme. [Internet] [Thesis]. Texas Tech University; 2010. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/2346/ETD-TTU-2010-12-1258.

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

Council of Science Editors:

Garcia EN. A Non-Recursive Universal Quantum Turing Machine Simulation in SequenceL with a Post-Selection Halting Scheme. [Thesis]. Texas Tech University; 2010. Available from: http://hdl.handle.net/2346/ETD-TTU-2010-12-1258

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

23. Tkačík Ján. Algoritmy pro analýzu časoprostorového chování podezřelých osob .

Degree: Czech University of Technology

 Mnoho studií prokázalo, že vzorce lidského pohybu mají vysoký stupeň jak prostorové, tak i časové pravidelnosti. Tento fakt nás ujišťuje, že je možné vytvořit model… (more)

Subjects/Keywords: Predikce mobility; Neural Turing Machine; Rekurentní neuronové sítě}; Detekce zajímavých míst; DBSCAN; LDBSCAN

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ján, T. (n.d.). Algoritmy pro analýzu časoprostorového chování podezřelých osob . (Thesis). Czech University of Technology. Retrieved from http://hdl.handle.net/10467/62771

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ján, Tkačík. “Algoritmy pro analýzu časoprostorového chování podezřelých osob .” Thesis, Czech University of Technology. Accessed November 29, 2020. http://hdl.handle.net/10467/62771.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ján, Tkačík. “Algoritmy pro analýzu časoprostorového chování podezřelých osob .” Web. 29 Nov 2020.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Ján T. Algoritmy pro analýzu časoprostorového chování podezřelých osob . [Internet] [Thesis]. Czech University of Technology; [cited 2020 Nov 29]. Available from: http://hdl.handle.net/10467/62771.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

Ján T. Algoritmy pro analýzu časoprostorového chování podezřelých osob . [Thesis]. Czech University of Technology; Available from: http://hdl.handle.net/10467/62771

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

24. Eastwood, Shawn. Genetic Programming for the Evolution of Functions with a Discrete Unbounded Domain.

Degree: 2013, University of Waterloo

 The idea of automatic programming using the genetic programming paradigm is a concept that has been explored in the work of Koza and several works… (more)

Subjects/Keywords: Genetic programming; discrete unbounded domain; real-time Turing machine

…RTGP1 imitating a Turing machine . . . . . . . . . Expression trees for TL2 in the RTGP1… …memory that is at least equivalent to a single Turing machine tape. While there has been much… …work done on the problem of evolving a Turing machine to act as a decider for a given… …integers as internal memory allows an agent to simulate an arbitrary Turing machine. Given an… …arbitrary Turing machine, there is a program that enables the agent to simulate one step of the… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Eastwood, S. (2013). Genetic Programming for the Evolution of Functions with a Discrete Unbounded Domain. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/7528

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

Eastwood, Shawn. “Genetic Programming for the Evolution of Functions with a Discrete Unbounded Domain.” 2013. Thesis, University of Waterloo. Accessed November 29, 2020. http://hdl.handle.net/10012/7528.

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

MLA Handbook (7th Edition):

Eastwood, Shawn. “Genetic Programming for the Evolution of Functions with a Discrete Unbounded Domain.” 2013. Web. 29 Nov 2020.

Vancouver:

Eastwood S. Genetic Programming for the Evolution of Functions with a Discrete Unbounded Domain. [Internet] [Thesis]. University of Waterloo; 2013. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/10012/7528.

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

Council of Science Editors:

Eastwood S. Genetic Programming for the Evolution of Functions with a Discrete Unbounded Domain. [Thesis]. University of Waterloo; 2013. Available from: http://hdl.handle.net/10012/7528

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

25. Liron, Romain. Approche écologique dans la conception d’outils cognitifs dans le domaine administratif : application à l’artisanat du bâtiment : Designing cognitive tools with ecological approach in administrative area for craftsmen.

Degree: Docteur es, Psychologie, 2016, Lorient

Ce travail adopte le cadre de l’ingénierie cognitive en vue de la conception et de l’évaluation d’outils cognitifs dans le domaine de l’administration d’entreprises artisanales.… (more)

Subjects/Keywords: Aide à la gestion administrative; Adminstration des entreprises artisanales; Outils cognitifs; Support numérique mobile; Conception d’Interfaces écologiques; Analyse du domaine de travail; TMTA; Cognitive tools interfaces; Turing Machine Task Analysis; 620.82

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liron, R. (2016). Approche écologique dans la conception d’outils cognitifs dans le domaine administratif : application à l’artisanat du bâtiment : Designing cognitive tools with ecological approach in administrative area for craftsmen. (Doctoral Dissertation). Lorient. Retrieved from http://www.theses.fr/2016LORIL391

Chicago Manual of Style (16th Edition):

Liron, Romain. “Approche écologique dans la conception d’outils cognitifs dans le domaine administratif : application à l’artisanat du bâtiment : Designing cognitive tools with ecological approach in administrative area for craftsmen.” 2016. Doctoral Dissertation, Lorient. Accessed November 29, 2020. http://www.theses.fr/2016LORIL391.

MLA Handbook (7th Edition):

Liron, Romain. “Approche écologique dans la conception d’outils cognitifs dans le domaine administratif : application à l’artisanat du bâtiment : Designing cognitive tools with ecological approach in administrative area for craftsmen.” 2016. Web. 29 Nov 2020.

Vancouver:

Liron R. Approche écologique dans la conception d’outils cognitifs dans le domaine administratif : application à l’artisanat du bâtiment : Designing cognitive tools with ecological approach in administrative area for craftsmen. [Internet] [Doctoral dissertation]. Lorient; 2016. [cited 2020 Nov 29]. Available from: http://www.theses.fr/2016LORIL391.

Council of Science Editors:

Liron R. Approche écologique dans la conception d’outils cognitifs dans le domaine administratif : application à l’artisanat du bâtiment : Designing cognitive tools with ecological approach in administrative area for craftsmen. [Doctoral Dissertation]. Lorient; 2016. Available from: http://www.theses.fr/2016LORIL391


Université de Montréal

26. Pilette, Simon. Programmes de génération et machines de Turing algébriques.

Degree: 2006, Université de Montréal

Subjects/Keywords: Programmation de génération; Semi-anneau; Machine de Turing algébrique; Complexité du calcul; Programme de branchement algébrique

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pilette, S. (2006). Programmes de génération et machines de Turing algébriques. (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/16734

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

Pilette, Simon. “Programmes de génération et machines de Turing algébriques.” 2006. Thesis, Université de Montréal. Accessed November 29, 2020. http://hdl.handle.net/1866/16734.

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

MLA Handbook (7th Edition):

Pilette, Simon. “Programmes de génération et machines de Turing algébriques.” 2006. Web. 29 Nov 2020.

Vancouver:

Pilette S. Programmes de génération et machines de Turing algébriques. [Internet] [Thesis]. Université de Montréal; 2006. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/1866/16734.

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

Council of Science Editors:

Pilette S. Programmes de génération et machines de Turing algébriques. [Thesis]. Université de Montréal; 2006. Available from: http://hdl.handle.net/1866/16734

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


Brno University of Technology

27. Hladík, Zdeněk. Multidimensionální automaty a jejich jazyky: Multi-Dimentional Automata and Their Languages.

Degree: 2019, Brno University of Technology

 This work includes brief overview of the theory behind two-dimentional languages which was the main theme examined in previous work. Based upon this theory there… (more)

Subjects/Keywords: multidimensionální jazyky; multidimensionální automaty; třídimensionální jazyky; třídi-mensionální automaty; multidimensionální buňka; formální gramatika; multidimensionální Turingův stroj; multi-dimentional languages; multi-dimentional automata; three-dimentional languages; three-dimentional automata; multi-dimentional cell; formal gramatic; multi-dimentional Turing machine

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hladík, Z. (2019). Multidimensionální automaty a jejich jazyky: Multi-Dimentional Automata and Their Languages. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/69502

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

Hladík, Zdeněk. “Multidimensionální automaty a jejich jazyky: Multi-Dimentional Automata and Their Languages.” 2019. Thesis, Brno University of Technology. Accessed November 29, 2020. http://hdl.handle.net/11012/69502.

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

MLA Handbook (7th Edition):

Hladík, Zdeněk. “Multidimensionální automaty a jejich jazyky: Multi-Dimentional Automata and Their Languages.” 2019. Web. 29 Nov 2020.

Vancouver:

Hladík Z. Multidimensionální automaty a jejich jazyky: Multi-Dimentional Automata and Their Languages. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/11012/69502.

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

Council of Science Editors:

Hladík Z. Multidimensionální automaty a jejich jazyky: Multi-Dimentional Automata and Their Languages. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/69502

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


Brno University of Technology

28. Kajan, Dušan. Výpočetní historie Turingových strojů a jejich generování gramatikami s rozptýleným kontextem: Computational Histories of Turing Machines and Their Generation by Scattered Context Grammars.

Degree: 2019, Brno University of Technology

 The purpose of this thesis is to show a method, that would transform given Turing machine into propagating scattered context grammar, which language contains all… (more)

Subjects/Keywords: { gramatiky s rozptýleným kontextem; Turingův stroj; algoritmus; Haskell; propagujíci gramatiky s rozptýleným kontextem; teoretická informatika; výpočetní historie; scattered context grammars; propagating scattered context grammars; theory of computation; Turing machine; algorithm; Haskell; computational history

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kajan, D. (2019). Výpočetní historie Turingových strojů a jejich generování gramatikami s rozptýleným kontextem: Computational Histories of Turing Machines and Their Generation by Scattered Context Grammars. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/64036

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

Kajan, Dušan. “Výpočetní historie Turingových strojů a jejich generování gramatikami s rozptýleným kontextem: Computational Histories of Turing Machines and Their Generation by Scattered Context Grammars.” 2019. Thesis, Brno University of Technology. Accessed November 29, 2020. http://hdl.handle.net/11012/64036.

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

MLA Handbook (7th Edition):

Kajan, Dušan. “Výpočetní historie Turingových strojů a jejich generování gramatikami s rozptýleným kontextem: Computational Histories of Turing Machines and Their Generation by Scattered Context Grammars.” 2019. Web. 29 Nov 2020.

Vancouver:

Kajan D. Výpočetní historie Turingových strojů a jejich generování gramatikami s rozptýleným kontextem: Computational Histories of Turing Machines and Their Generation by Scattered Context Grammars. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/11012/64036.

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

Council of Science Editors:

Kajan D. Výpočetní historie Turingových strojů a jejich generování gramatikami s rozptýleným kontextem: Computational Histories of Turing Machines and Their Generation by Scattered Context Grammars. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/64036

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

29. Kalyanasundaram, Subrahmanyam. Turing machine algorithms and studies in quasi-randomness.

Degree: PhD, Computing, 2011, Georgia Tech

 Randomness is an invaluable resource in theoretical computer science. However, pure random bits are hard to obtain. Quasi-randomness is a tool that has been widely… (more)

Subjects/Keywords: Quasi-randomness; Algorithm; Lower bound; Turing machines; Regularity lemma; Combinatorics; Complexity theory; Machine theory; Algorithms; Computer science; Computer science Mathematics

…lemma. Finally, we study the derandomization of complexity classes using Turing machine… …towards derandomizing complexity classes using Turing machine simulations. We look at the… …nondeterministic Turing machine. We pro√ ˜ S), where S is the vide a deterministic algorithm, which… …deterministically counting the number of accepting computations of a nondeterministic Turing machine. We… 

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

Kalyanasundaram, S. (2011). Turing machine algorithms and studies in quasi-randomness. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/42808

Chicago Manual of Style (16th Edition):

Kalyanasundaram, Subrahmanyam. “Turing machine algorithms and studies in quasi-randomness.” 2011. Doctoral Dissertation, Georgia Tech. Accessed November 29, 2020. http://hdl.handle.net/1853/42808.

MLA Handbook (7th Edition):

Kalyanasundaram, Subrahmanyam. “Turing machine algorithms and studies in quasi-randomness.” 2011. Web. 29 Nov 2020.

Vancouver:

Kalyanasundaram S. Turing machine algorithms and studies in quasi-randomness. [Internet] [Doctoral dissertation]. Georgia Tech; 2011. [cited 2020 Nov 29]. Available from: http://hdl.handle.net/1853/42808.

Council of Science Editors:

Kalyanasundaram S. Turing machine algorithms and studies in quasi-randomness. [Doctoral Dissertation]. Georgia Tech; 2011. Available from: http://hdl.handle.net/1853/42808

30. 三原, 孝志. 量子計算の複雑さに関する研究.

Degree: Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学

Supervisor:國藤 進

情報科学研究科

博士

Subjects/Keywords: 量子計算, 量子 Turing 機械, 量子計算量クラス, 周期関数, 擬似乱数発生器, 量子探索アルゴリズム, NP 完全問題, 充足可能性判定問題; quantum computation, quantum Turing machine, quant

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

三原, . (n.d.). 量子計算の複雑さに関する研究. (Thesis). Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学. Retrieved from http://hdl.handle.net/10119/832

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

三原, 孝志. “量子計算の複雑さに関する研究.” Thesis, Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学. Accessed November 29, 2020. http://hdl.handle.net/10119/832.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

三原, 孝志. “量子計算の複雑さに関する研究.” Web. 29 Nov 2020.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

三原 . 量子計算の複雑さに関する研究. [Internet] [Thesis]. Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学; [cited 2020 Nov 29]. Available from: http://hdl.handle.net/10119/832.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

三原 . 量子計算の複雑さに関する研究. [Thesis]. Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学; Available from: http://hdl.handle.net/10119/832

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

[1] [2]

.