scientific article; zbMATH DE number 1869998

DOI10.1023/A:1015659418145zbMath1034.03514OpenAlexW1525292600MaRDI QIDQ4792713

Benjamin B. jun. Wells

Publication date: 17 February 2003

Published in: Minds and Machines (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1015659418145

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

effective procedurepseudorecursive theoryChurch-Turing Thesisquotidian procedureTuring decidability

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Decidability of theories and sets of sentences (03B25) General topics in artificial intelligence (68T01)

Related Items (4)

What is the Church-Turing Thesis? ⋮ Applying, extending, and specializing pseudorecursiveness ⋮ Hypercomputation by definition ⋮ The case for hypercomputation

This page was built for publication: