Tarski–Kuratowski algorithm
id:
tarski-kuratowski-algorithm-324-4041677
title:
Tarski–Kuratowski algorithm
text:
In computability theory and mathematical logic the Tarski–Kuratowski algorithm is a non-deterministic algorithm that produces an upper bound for the complexity of a given formula in the arithmetical hierarchy and analytical hierarchy. The algorithm is named after Alfred Tarski and Kazimierz Kuratowski.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Tarski%E2%80%93Kuratowski_algorithm
date created:
date modified:
2022-12-29T16:59:33Z
main entity:
{"identifier":"Q7686764","url":"https://www.wikidata.org/entity/Q7686764"}
image:
fields total:
13
integrity:
13