Computability Logic: A Formal Theory of Interactive Computability: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 15:4615:46, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,813 bytes +140‎ No edit summary undo
  • curprev 15:4615:46, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,673 bytes +1,673‎ Created page with "Title: Computability Logic: A Formal Theory of Interactive Computability Research Question: How can computability logic, a new approach to understanding computational problems, help us better understand and formalize the concept of interactive computability? Methodology: The authors propose a new approach called computability logic (CL), which views computational problems as games played by a machine against the environment. The machine's goal is to always win the game..."
Retrieved from "https://simplesci.org/wiki/Computability_Logic:_A_Formal_Theory_of_Interactive_Computability"