J.V. Tucker: 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 02:4702:47, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,658 bytes +1,658‎ Created page with "Title: J.V. Tucker Research Question: Can abstract computability be defined and characterized using algebraic specifications? Methodology: The researchers used abstract computability theory, which is a generalization of classical recursion theory on the natural numbers. They focused on many-sorted algebras and developed a model of computation called µPR∗. This model involves simultaneous primitive recursion and least number search, and is equivalent to 'while'-array..."
Retrieved from "https://simplesci.org/wiki/J.V._Tucker"