Relevant bibliographies by topics / Recursively enumerable sets

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Recursively enumerable sets'

Author: Grafiati
Published: 4 June 2021
Last updated: 17 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Recursively enumerable sets.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Recursively enumerable sets"

1

Korol′kov, Y. D. "Completely recursively enumerable sets." Siberian Mathematical Journal 40, no. 3 (1999): 500–505. http://dx.doi.org/10.1007/bf02679757.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lempp, Steffen, and Theodore A. Slaman. "A limit on relative genericity in the recursively enumerable sets." Journal of Symbolic Logic 54, no. 2 (1989): 376–95. http://dx.doi.org/10.2307/2274854.

Full text
Abstract:
AbstractWork in the setting of the recursively enumerable sets and their Turing degrees. A set X is low if X′, its Turing jump, is recursive in ∅′ and high if X′ computes ∅″. Attempting to find a property between being low and being recursive, Bickford and Mills produced the following definition. W is deep, if for each recursively enumerable set A, the jump of A ⊕ W is recursive in the jump of A. We prove that there are no deep degrees other than the recursive one.Given a set W, we enumerate a set A and approximate its jump. The construction of A is governed by strategies, indexed by the Turin
APA, Harvard, Vancouver, ISO, and other styles
3

Ambos-Spies, Klaus. "Anti-Mitotic Recursively Enumerable Sets." Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 31, no. 29-30 (1985): 461–77. http://dx.doi.org/10.1002/malq.19850312903.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Rota, Gian-Carlo. "Recursively enumerable sets and degrees." Advances in Mathematics 71, no. 1 (1988): 130. http://dx.doi.org/10.1016/0001-8708(88)90069-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Rybalov, A. N. "Generic Amplification of Recursively Enumerable Sets." Algebra and Logic 57, no. 4 (2018): 289–94. http://dx.doi.org/10.1007/s10469-018-9500-y.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Foryś, Wit. "Some Characterization of Recursively Enumerable Sets." International Journal of Computer Mathematics 79, no. 2 (2002): 157–63. http://dx.doi.org/10.1080/00207160211924.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Halava, Vesa, Tero Harju, Hendrik Jan Hoogeboom, and Michel Latteux. "Equality sets for recursively enumerable languages." RAIRO - Theoretical Informatics and Applications 39, no. 4 (2005): 661–75. http://dx.doi.org/10.1051/ita:2005035.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Calude, Cristian S., André Nies, Ludwig Staiger, and Frank Stephan. "Universal recursively enumerable sets of strings." Theoretical Computer Science 412, no. 22 (2011): 2253–61. http://dx.doi.org/10.1016/j.tcs.2011.01.002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sui, Yuefei. "Bounded recursively enumerable sets and degrees." Journal of Computer Science and Technology 8, no. 3 (1993): 205–8. http://dx.doi.org/10.1007/bf02939527.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Downey, Rod, and Michael Stob. "Friedberg splittings of recursively enumerable sets." Annals of Pure and Applied Logic 59, no. 3 (1993): 175–99. http://dx.doi.org/10.1016/0168-0072(93)90092-r.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Recursively enumerable sets"

1

Watson, P. R. "Concerning d-recursively enumerable sets and s-reducibility of #SIGMA#2̲ sets." Thesis, University of Leeds, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.234670.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Cholak, Peter Abe. "Automorphisms of the lattice of recursively enumerable sets." 1991. http://catalog.hathitrust.org/api/volumes/oclc/24493905.html.

Full text
Abstract:
Thesis (Ph. D.)--University of Wisconsin--Madison, 1991.<br>Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 173-175).
APA, Harvard, Vancouver, ISO, and other styles
3

Chen, Chao-Wei, and 陳昭瑋. "A Note on Recursively Enumerable Sets and Computable Functions." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/96648458207305269166.

Full text
Abstract:
碩士<br>國立中正大學<br>哲學所<br>97<br>The main goal of this thesis is to survey the theorems and properties related to recursively enumerable function, and rephrase or reorganize these theorems and properties. In Chapter one, I will first explain the concept of ``computable'' in an intuitive way, and then describe two different formal ways to define computability: by (partial) recursive functions or by Turing computable functions. I will look into the recursive function approach and introduce some basic results of it. Two important relevant concepts, recursively enumerable sets and index sets will also
APA, Harvard, Vancouver, ISO, and other styles
4

Wald, Kevin Mitchell. "Automorphisms and noninvariant properties of the computable enumerable sets /." 1999. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:9943125.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kaddah, Deborah Suzanne. "Uniformity in the recursively enumerable degrees and infima in the degrees of the differences of recursively enumberable sets." 1992. http://catalog.hathitrust.org/api/volumes/oclc/28725513.html.

Full text
Abstract:
Thesis (Ph. D.)--University of Wisconsin--Madison, 1992.<br>Typescript. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 100-102).
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Recursively enumerable sets"

1

Soare, Robert I. Recursively Enumerable Sets and Degrees. Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/978-3-662-02460-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Automorphisms of the lattice of recursively enumerable sets. American Mathematical Society, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Soare, R. I. Recursively enumerable sets and degrees: A study of computable functions and computably generated sets. Springer-Verlag, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Soare, Robert I. Recursively Enumberable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Perspectives in Mathematical Logic). Springer, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

The Role of True Finiteness in the Admissible Recursively Enumerable Degrees (Memoirs of the American Mathematical Society, No. 854) (Memoirs of the American Mathematical Society). American Mathematical Society, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Soare, Robert I. Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Perspectives in Mathematical Logic). Springer, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Recursively enumerable sets"

1

Anglin, W. S., and J. Lambek. "Recursive and Recursively Enumerable Sets." In The Heritage of Thales. Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-0803-7_52.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Weihrauch, Klaus. "Recursive and Recursively Enumerable Sets." In Computability. Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/978-3-642-69965-8_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Weihrauch, Klaus. "Recursive and Recursively Enumerable Sets (Continued)." In Computability. Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/978-3-642-69965-8_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Jockusch, Carl G. "Genericity for recursively enumerable sets." In Lecture Notes in Mathematics. Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/bfb0076222.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Merkle, Wolfgang, Frank Stephan, Jason Teutsch, Wei Wang, and Yue Yang. "Selection by Recursively Enumerable Sets." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38236-9_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Chiswell, Ian M. "Recursively Enumerable Sets and Languages." In A Course in Formal Languages, Automata and Groups. Springer London, 2008. http://dx.doi.org/10.1007/978-1-84800-940-0_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Omanadze, Roland Sh. "Quasi-Degrees of Recursively Enumerable Sets." In Computability and Models. Springer US, 2003. http://dx.doi.org/10.1007/978-1-4615-0755-0_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Chong, C. T. "Recursively enumerable sets in models of Σ2 collection." In Mathematical Logic and Applications. Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/bfb0083664.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Soare, Robert I. "Fundamentals of Recursively Enumerable Sets and the Recursion Theorem." In Perspectives in Mathematical Logic. Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/978-3-662-02460-7_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Arslanov, M. M. "The recursion theorem, approximations, and classifying index sets of recursively enumerable sets." In Fundamentals of Computation Theory. Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-18740-5_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Recursively enumerable sets"

1

Zaslavsky, Igor D. "On the logical semantics of the symmetric constructive logic based on the properties of recursively enumerable sets." In 2013 Computer Science and Information Technologies (CSIT). IEEE, 2013. http://dx.doi.org/10.1109/csitechnol.2013.6710335.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Reddy, Shilpitha Bomi, and Zahed Siddique. "Formulating and Searching Assembly Sequence Design Spaces to Increase the Utilization of Current Assembly Plant Resources." In ASME 2006 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2006. http://dx.doi.org/10.1115/detc2006-99339.

Full text
Abstract:
Efficient procedures for generation of feasible assembly sequences and effective utilization of available assembly plant resources can greatly reduce the development time and cost for platforms for the new product family members. This paper presents a method application to generate feasible assembly sequences and an approach to select an assembly process that reduces the existing plant modification cost. Assembly sequence design space is combinatorial in nature. Mathematical models to solve the effects of constraints on these spaces and algorithms to efficiently enumerate feasible spaces are p
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography