Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Recursion
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Bibliography== {{refbegin}} * {{cite journal|first=Edsger W.|last=Dijkstra|author-link=Edsger W. Dijkstra|title=Recursive Programming|journal=Numerische Mathematik|volume=2|issue=1|year=1960|pages=312–318|doi=10.1007/BF01386232|s2cid=127891023}} *{{cite book | author=Johnsonbaugh, Richard|author-link=Richard Johnsonbaugh | title=Discrete Mathematics | publisher=Prentice Hall | year=2004 | isbn=978-0-13-117686-7 }} *{{cite book | author=Hofstadter, Douglas | author-link=Douglas Hofstadter | title=Gödel, Escher, Bach: an Eternal Golden Braid | publisher=Basic Books | year=1999 | isbn=978-0-465-02656-2 | url=https://archive.org/details/gdelescherbachet00hofs }} *{{cite book | author=Shoenfield, Joseph R. |author-link=Joseph R. Shoenfield| title=Recursion Theory | url=https://archive.org/details/recursiontheory0000shoe | url-access=registration | publisher=A K Peters Ltd | year=2000 | isbn=978-1-56881-149-9 }} *{{cite book | author=[[Causey, Robert L.]] | title=Logic, Sets, and Recursion | url=https://archive.org/details/logicsetsrecursi0000caus | url-access=registration | publisher=Jones & Bartlett | year=2001 | isbn=978-0-7637-1695-0 }} *{{cite book |author1=Cori, Rene |author2=Lascar, Daniel |author3=Pelletier, Donald H. | title=Recursion Theory, Gödel's Theorems, Set Theory, Model Theory | publisher=Oxford University Press | year=2001 | isbn=978-0-19-850050-6 }} *{{cite book | author1=Barwise, Jon| author2=Moss, Lawrence S. |author1-link=Jon Barwise| title=Vicious Circles | publisher=Stanford Univ Center for the Study of Language and Information | year=1996 | isbn=978-0-19-850050-6 }} - offers a treatment of [[corecursion]]. *{{cite book | author=Rosen, Kenneth H. | title=Discrete Mathematics and Its Applications | publisher=McGraw-Hill College | year=2002 | isbn=978-0-07-293033-7 }} *{{cite book | last1=Cormen |first1=Thomas H. |first2=Charles E. |last2=Leiserson |first3=Ronald L. |last3=Rivest |first4=Clifford |last4=Stein | title=Introduction to Algorithms | publisher=Mit Pr | year=2001 | isbn=978-0-262-03293-3 }} *{{cite book |author1=Kernighan, B. |author2=Ritchie, D. |title=The C programming Language |publisher=Prentice Hall |year=1988 |isbn=978-0-13-110362-7 |url=https://archive.org/details/cprogramminglang00bria }} *{{cite book |author1=Stokey, Nancy |author2=Robert Lucas |author3=Edward Prescott | title=Recursive Methods in Economic Dynamics | publisher=Harvard University Press | year=1989 | isbn=978-0-674-75096-8}} *{{cite book | author=Hungerford |title=Algebra | publisher=Springer|year=1980|isbn=978-0-387-90518-1}}, first chapter on set theory. {{refend}}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)