In computability theory, Kleene's recursion theorems are a pair of fundamental results about the application of computable functions to their ownâ€¦Â (More)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

This lecture will summarise core ideas in the theory of computing, including basic recursive function theory, using concepts fromâ€¦Â (More)

Is this relevant?

2013

2013

- John Case, Sanjay Jain, Frank Stephan
- LFCS
- 2013

The present paper explores the interaction between two recursion-theoretic notions: program self-reference and learning partialâ€¦Â (More)

Is this relevant?

2009

2009

- Rebecca Weber
- 2009

Kleeneâ€™s Recursion Theorem, though provable in only a few lines, is fundamental to computability theory and allows strong selfâ€¦Â (More)

Is this relevant?

2009

2009

- John Case, Samuel E. Moelius
- Theory of Computing Systems
- 2009

Intuitively, a recursion theorem asserts the existence of self-referential programs . Two well-known recursion theorems areâ€¦Â (More)

Is this relevant?

2007

2007

- John Case, Samuel E. Moelius
- Theory of Computing Systems
- 2007

The interest is in characterizing insightfully the power of program self-reference in effective programming systems ( $\mathsfâ€¦Â (More)

Is this relevant?

2007

2007

- Farrukh Mukhamedov
- Appl. Math. Lett.
- 2007

In the paper we completely describe the set of all solutions of a recursive equation, arising from the Bethe lattice models overâ€¦Â (More)

Is this relevant?

2005

2005

- Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
- Journal in Computer Virology
- 2005

We are concerned with theoretical aspects of computer viruses. For this, we suggest a new definition of viruses which is clearlyâ€¦Â (More)

Is this relevant?

2005

2005

- Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
- ICTAC
- 2005

We are concerned with theoretical aspects of computer viruses. For this, we suggest a new definition of viruses which is clearlyâ€¦Â (More)

Is this relevant?

2001

2001

- Sanjay Jain, Jochen Nessel
- J. Symb. Log.
- 2001

Acceptable programming systems have many nice properties like s-m-n-Theorem, Composition and Kleene Recursion Theorem. Thoseâ€¦Â (More)

Is this relevant?

1998

1998

- Helmut Schwichtenberg
- Ann. Pure Appl. Logic
- 1998

In 1] Buchholz presented a method to build notation systems for innnite sequent-style derivations, analogous to well-knownâ€¦Â (More)

Is this relevant?