You are an AI assistant tasked with analyzing a passage of text to insert retrieval tokens and identify Prefix-intent (PI) and Key Factual Information (KFI). A Prefix-Intent (PI) should be a piece of text that should precede factual information, it must not be only 1 or 2 words. Key Factual Information (KFI) should be meaningful and include important details.

Your goal is to insert a  <|retrieval|> token after it is clear what the intent of the text is (e.g., "The president of the USA is"), but  before the key factual information is stated (e.g., "Joe Biden"). Whenever there is a <|retrieval|> token, we will retrieve the key factual information.

Here is the passage you will be working with:

<passage>
Super-recursive algorithm In computability theory, super-recursive algorithms are a generalization of ordinary algorithms that are more powerful, that is, compute more than Turing machines. The term was introduced by Mark Burgin, whose book "Super-recursive algorithms" develops their theory and presents several mathematical models. Turing machines and other mathematical models of conventional algorithms allow researchers to find properties of recursive algorithms and their computations. In a similar way, mathematical models of super-recursive algorithms, such as inductive Turing machines, allow researchers to find properties of super-recursive algorithms and their computations. Burgin, as well as other researchers (including Selim Akl, Eugene Eberbach, Peter Kugel, Jan van Leeuwen, Hava Siegelmann, Peter Wegner, and Jiří Wiedermann) who studied different kinds of super-recursive algorithms and contributed to the theory of super-recursive algorithms, have argued that super-recursive algorithms can be used to disprove the Church-Turing thesis, but this point of view has been criticized within the mathematical community and is not widely accepted. Definition Burgin (2005: 13) uses the term recursive algorithms for algorithms that can be implemented on Turing machines, and uses the word algorithm in a more general sense. Then a super-recursive class of algorithms is "a class of algorithms in which it is possible to compute functions not computable by any Turing machine" (Burgin 2005: 107). Super-recursive algorithms are closely related to hypercomputation in a way similar to the relationship between ordinary computation and ordinary algorithms. Computation is a process, while an algorithm is a finite constructive description of such a process. Thus a super-recursive algorithm defines a "computational process (including processes of input and output) that cannot be realized by recursive algorithms." (Burgin 2005: 108). A more restricted definition demands that hypercomputation solves a supertask (see Copeland 2002; Hagar and Korolev 2007). Super-recursive algorithms are also related to algorithmic schemes, which are more general than super-recursive algorithms. Burgin argues (2005: 115) that it is necessary to make a clear distinction between super-recursive algorithms and those algorithmic schemes that are not algorithms. Under this distinction, some types of hypercomputation are obtained by super-recursive algorithms, e.g., inductive Turing machines, while other types of hypercomputation are directed by algorithmic schemas, e.g., infinite time Turing machines. This explains how works on super-recursive algorithms are related to hypercomputation and vice versa. According to this argument, super-recursive algorithms are just one way of defining a hypercomputational process. Examples Examples of super-recursive algorithms include (Burgin 2005: 132): limiting recursive functions and limiting partial recursive functions (E.M. Gold 1965) trial and error predicates (Hilary Putnam 1965) inductive inference machines (Carl Smith) inductive Turing machines, which perform computations similar to computations of Turing machines and produce their results after a finite number of steps (Mark Burgin) limit Turing machines, which perform computations similar to computations of Turing machines but their final results are limits of their intermediate results (Mark Burgin) trial-and-error machines (Ja. Hintikka and A. Mutanen 1998) general Turing machines (J. Schmidhuber) Internet machines (van Leeuwen, J. and Wiedermann, J.) evolutionary computers, which use DNA to produce the value of a function (Darko Roglic) fuzzy computation (Jirí Wiedermann 2004) evolutionary Turing machines (Eugene Eberbach 2005) Examples of algorithmic schemes include: Turing machines with arbitrary oracles (Alan Turing) Transrecursive operators (Borodyanskii and Burgin) machines that compute with real numbers (L. Blum, F. Cucker, M. Shub, and S. Smale 1998) neural networks based on real numbers (Hava Siegelmann 1999) For examples of practical super-recursive algorithms, see the book of Burgin. Inductive Turing machines Inductive Turing machines implement an important class of super-recursive algorithms. An inductive Turing machine is a definite list of well-defined instructions for completing a task which, when given an initial
</passage>

Follow these steps to complete the task:

1. Inserting retrieval tokens:
   a. Read through the text carefully.
   b. Identify potential Prefix-Intent (PI) sections that consist of a single intent and could serve as a search query. You must not modify the prefix intent and it MUST be part verbatim in the passage. It cannot be single or only a few words.
   c. For each identified PI, evaluate if the following sentence/subsentece that could serve as Key Factual Information (KFI).
   d. Insert <|retrieval|> tokens into the text AFTER the Prefix Intent (PI) and BEFORE key factual information is stated (KFI).
   e. Key Factual information should not intersect with Prefix Intent.

2. Identifying Prefix-Intent (PI) and Key Factual Information (KFI):
   a. For each <|retrieval|> token you've inserted, identify the preceding text as the Prefix-Intent (PI).
   b. Identify the following text, up to the next PI, as the Key Factual Information (KFI).
   c. Ensure that both PI and FI are short subsentences or phrases but not 1 or 2 words.

3. Insert <|start-PI|>,<|end-PI|>, <|start-KFI|>, <|end-KFI|>.
   a. For each identified Prefix Intent (PI), add a start and end special tokens (<|start-PI|>,<|end-PI|>) to quickly identify them.
   b. Do the same for the Key Factual Information (KFI) (<|start-KFI|>, <|end-KFI|>)
   c. Ensure that the very first PI in the passage is preceded by <|start-PI|>.
   d. Double-check that every PI and KFI is properly enclosed in these tags.

4. Describing ideal retrieved information:
   a. Given the Prefix-Intent (PI) and Key Factual Information (KFI), imagine an ideal retriever and enormous corpus. 
   b. Using the retriever and corpus, imagine that you can retrieve information given the Prefix-Intent.  
   c. Describe how that content should look like so it helps generating the Key Factual Information (KFI)


5. Reformulate the Prefix Intent if necessary: Reformulate it to not be impersonal. This means that if the subject it is not identified (e.g. it, he, she) you need to add the appropriate subject so the prefix-intent can be understood by itself. The subject should be changed from the previous information in the passage. Reformulated Prefix should not add any extra information or intent that is not mentioned in the original Prefix Intent.


6. Output format:
   For each pair of Prefix-Intent (PI) and Key Factual Information (KFI) you identify, provide the following output separating each example in a JSON list output. Ensure that it is actually a JSON.

   - Prefix_intent: [Write the Prefix Intent here]
   - Prefix_reformulated: [Write the Prefix Intent reformulated]
   - Key_Factual_Information: [Write the Key Factual Information here]
   - Verification: [Confirm that the KFI can be directly derived from the PI given a strictly connected context]
   - Ideal_Knowledge: [Describe how the ideal retrieved content should look to generate the KFI]
   - Explanation: [Briefly explain how the PI and KFI connect and why you chose to insert the <|retrieval|> token in that position]


7. Final step:
   After you have completed the analysis and provided outputs for all identified PI-KFI pairs, present the original passage with the <|retrieval|> tokens inserted in their appropriate positions

Here's an example of the expected output format:

Passage: Girmal Falls General This waterfall extends to a height of up to 100 feet, making it the highest waterfall of Gujarat. The picturesque beauty of this site makes it popular among visitors and people of the region alike. The water swiftly falls from a great height, creating a fog like condition that’s eye catching. The government of this state is working on many projects to make this place an ideal picnic spot and a tourist attraction. The fall comes to its best form at the time of monsoon and provides an immensely striking appearance. Some of the best natural features of Gujarat can be explored in this place. This place is a nice and refreshing retreat for any traveler.

```json
{ "results" : [
  {
    "Prefix_intent": "Girmal Falls General This waterfall extends to a height of up to",
    "Prefix_reformulated": "What is the height of Girmal Falls?",
    "Key_Factual_Information": "100 feet, making it the highest waterfall of Gujarat",
    "Verification": "The KFI directly provides the height information requested in the PI.",
    "Ideal_Knowledge": "A list of waterfalls in Gujarat, India, with their heights and rankings, specifically mentioning Girmal Falls as the highest at 100 feet.",
    "Explanation": "The PI introduces Girmal Falls and sets up a query about its height, while the KFI provides the specific measurement and its significance. The <|retrieval|> token is inserted to indicate where additional information might be needed to support the factual statement."
  },
  {
    "Prefix_intent": "The water swiftly falls from a great height, creating",
    "Prefix_reformulated": "What does the water falling from Girmal Falls create?",
    "Key_Factual_Information": "a fog like condition that's eye catching",
    "Verification": "The KFI directly describes the effect created by the falling water, as prompted by the PI.",
    "Ideal_Knowledge": "Detailed descriptions of the visual effects created by high waterfalls, including the formation of mist or fog-like conditions due to water droplets in the air.",
    "Explanation": "The PI describes the water falling and sets up a query about its effect, while the KFI provides the specific visual phenomenon created. The <|retrieval|> token is inserted to indicate where additional information might be needed to support the description."
  },
  {
    "Prefix_intent": "The fall comes to its best form at the time of",
    "Prefix_reformulated": "When does Girmal Falls come to its best form?",
    "Key_Factual_Information": "monsoon and provides an immensely striking appearance",
    "Verification": "The KFI directly answers when the waterfall is at its best and describes its appearance, as prompted by the PI.",
    "Ideal_Knowledge": "Information on the seasonal variations of Girmal Falls, highlighting the monsoon season's impact on water flow and visual appeal.",
    "Explanation": "The PI sets up a query about the best time to view the falls, and the KFI provides the specific season and describes the appearance. The <|retrieval|> token is inserted to indicate where additional information about seasonal changes might be needed."
  }],
"Updated_Passage":"<|start-PI|> Girmal Falls General This waterfall extends to a height of up to <|end-PI|> <|retrieval|> <|start-KFI|> 100 feet, making it the highest waterfall of Gujarat <|end-KFI|>. The picturesque beauty of this site makes it popular among visitors and people of the region alike. <|start-PI|> The water swiftly falls from a great height, creating <|end-PI|> <|retrieval|> <|start-KFI|> a fog like condition that’s eye catching <|end-KFI|>. The government of this state is working on many projects to make this place an ideal picnic spot and a tourist attraction. <|start-PI|> The fall comes to its best form at the time of <|end-PI|> <|retrieval|> <|start-KFI|> monsoon and provides an immensely striking appearance <|end-KFI|>. Some of the best natural features of Gujarat can be explored in this place. This place is a nice and refreshing retreat for any traveler."
}

```
8. Final check:
  a. Review the Updated_Passage to ensure all PIs and KFIs are properly tagged.
  b. Verify that the first PI in the passage starts with <|start-PI|>.
  c. Make sure there are no missing or misplaced tags.
 
Remember to analyze the entire passage, identify all relevant PI-KFI pairs, and provide the output for each pair as specified. After completing the analysis, present the original passage with the <|retrieval|> tokens inserted in their appropriate positions as part of a new key in the JSON file. Only Ouput the JSON File.