Hungarian algorithm: Difference between revisions

Latest revision as of 21:17, 19 November 2014

The author is known by the title of Figures Wunder. My working day occupation is a meter reader. Body building is what my family and I appreciate. For a while I've been in South Dakota and my mothers and fathers live nearby.

Take a look at my webpage; home std test kit (visit my webpage)

@@ Line 1: / Line 1: @@
-In [[computability theory (computer science)|computability theory]] two sets <math>A;B \subseteq \N</math> of [[natural number]]s are '''computably isomorphic''' or '''recursively isomorphic''' if there exists a [[Total function|total]] [[bijective]] [[computable function]] <math>f \colon \N \to \N</math> with <math>f(A) = B</math>.
+The author is known by the title of Figures Wunder. My working day occupation is a meter reader. Body building is what my family and I appreciate. For a while I've been in South Dakota and my mothers and fathers live nearby.<br><br>Take a look at my webpage; home std test kit ([http://www.animecontent.com/user/D2456 visit my webpage])
-Two [[numbering (computability theory)|numbering]]s <math>\nu</math> and <math>\mu</math> are called '''computably isomorphic''' if there exists a computable bijection <math>f</math> so that <math>\nu = \mu \circ f</math>
-Computably isomorphic numberings induce the same notion of computability on a set.
-== References ==
-*{{citation
- | last = Rogers | first = Hartley, Jr. | author-link = Hartley Rogers, Jr.
- | edition = 2nd
- | isbn = 0-262-68052-1
- | location = Cambridge, MA
- | mr = 886890
- | publisher = MIT Press
- | title = Theory of recursive functions and effective computability
- | year = 1987}}.
-{{DEFAULTSORT:Computable Isomorphism}}
-[[Category:Theory of computation]]
-[[Category:Computability theory]]
-{{comp-sci-theory-stub}}
-{{mathlogic-stub}}

Hungarian algorithm: Difference between revisions

Latest revision as of 21:17, 19 November 2014

Navigation menu

Search