Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Martin-Löf randomness | Statement: [Kolmogorov complexity, relatedTo, Martin-Löf randomness]

Target entity: Martin-Löf randomness
Context triple: [Kolmogorov complexity, relatedTo, Martin-Löf randomness]

• A. Kolmogorov complexity
  Kolmogorov complexity is a measure of the amount of information in an object, defined as the length of the shortest computer program that can produce it.
• B. Randomness and Computation
  "Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
• C. Turing degrees
  Turing degrees are an abstract classification of sets of natural numbers or decision problems according to their relative level of algorithmic unsolvability or computational complexity under Turing reducibility.
• D. Blum complexity measures
  Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
• E. Blum axioms
  Blum axioms are a set of formal conditions introduced by Manuel Blum that rigorously define what constitutes a valid complexity measure in computational complexity theory.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: Martin-Löf randomness
Triple: [Kolmogorov complexity, relatedTo, Martin-Löf randomness]

Martin-Löf randomness is a rigorous mathematical notion of randomness for infinite binary sequences, defined via effectively null sets and closely connected to algorithmic information theory.

Target entity: Martin-Löf randomness
Target entity description: Martin-Löf randomness is a rigorous mathematical notion of randomness for infinite binary sequences, defined via effectively null sets and closely connected to algorithmic information theory.

• A. Kolmogorov complexity
  Kolmogorov complexity is a measure of the amount of information in an object, defined as the length of the shortest computer program that can produce it.
• B. Randomness and Computation
  "Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
• C. Turing degrees
  Turing degrees are an abstract classification of sets of natural numbers or decision problems according to their relative level of algorithmic unsolvability or computational complexity under Turing reducibility.
• D. Blum complexity measures
  Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
• E. Blum axioms
  Blum axioms are a set of formal conditions introduced by Manuel Blum that rigorously define what constitutes a valid complexity measure in computational complexity theory.
• F. None of above. chosen