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>
state, will proceed through a well-defined series of successive states, eventually giving the final result. The difference between an inductive Turing machine and an ordinary Turing machine is that an ordinary Turing machine must stop when it has obtained its result, while in some cases an inductive Turing machine can continue to compute after obtaining the result, without stopping. Kleene called procedures that could run forever without stopping by the name calculation procedure or algorithm (Kleene 1952:137). Kleene also demanded that such an algorithm must eventually exhibit "some object" (Kleene 1952:137). Burgin argues that this condition is satisfied by inductive Turing machines, as their results are exhibited after a finite number of steps. The reason that inductive Turing machines cannot be instructed to halt when their final output is produced is that in some cases inductive Turing machines may not be able to tell at which step the result has been obtained. Simple inductive Turing machines are equivalent to other models of computation such as general Turing machines of Schmidhuber, trial and error predicates of Hilary Putnam, limiting partial recursive functions of Gold, and trial-and-error machines of Hintikka and Mutanen (1998). More advanced inductive Turing machines are much more powerful. There are hierarchies of inductive Turing machines that can decide membership in arbitrary sets of the arithmetical hierarchy (Burgin 2005). In comparison with other equivalent models of computation, simple inductive Turing machines and general Turing machines give direct constructions of computing automata that are thoroughly grounded in physical machines. In contrast, trial-and-error predicates, limiting recursive functions, and limiting partial recursive functions present only syntactic systems of symbols with formal rules for their manipulation. Simple inductive Turing machines and general Turing machines are related to limiting partial recursive functions and trial-and-error predicates as Turing machines are related to partial recursive functions and lambda calculus. The non-halting computations of inductive Turing machines should not be confused with infinite-time computations (see, for example, Potgieter 2006). First, some computations of inductive Turing machines do halt. As in the case of conventional Turing machines, some halting computations give the result, while others do not. Even if it does not halt, an inductive Turing machine produces output from time to time. If this output stops changing, it is then considered the result of the computation. There are two main distinctions between ordinary Turing machines and simple inductive Turing machines. The first distinction is that even simple inductive Turing machines can do much more than conventional Turing machines. The second distinction is that a conventional Turing machine will always determine (by coming to a final state) when the result is obtained, while a simple inductive Turing machine, in some cases (such as when "computing" something that cannot be computed by an ordinary Turing machine), will not be able to make this determination. Schmidhuber's generalized Turing machines A symbol sequence is computable in the limit if there is a finite, possibly non-halting program on a universal Turing machine that incrementally outputs every symbol of the sequence. This includes the dyadic expansion of π but still excludes most of the real numbers, because most cannot be described by a finite program. Traditional Turing machines with a write-only output tape cannot edit their previous outputs; generalized Turing machines, according to Jürgen Schmidhuber, can edit their output tape as well as their work tape. He defines the constructively describable symbol sequences as those that have a finite, non-halting program running on a generalized Turing machine, such that any output symbol eventually converges, that is, it does not change any more after some finite initial time interval. Schmidhuber (2000, 2002) uses this
</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.