RSS

beastaugh + computability   44

Ackermann function in the Primitive recursive arithmetic - MathOverflow
arithmetic  computability  kleene  metamathematics 
5 weeks ago by beastaugh
MSE: How is Kleene's T predicate defined?
metamathematics  kleene  arithmetic  computability 
5 weeks ago by beastaugh
Kleene's T predicate - Wikipedia
arithmetic  computability  metamathematics  kleene 
5 weeks ago by beastaugh
Infinite finitely branching recursive tree with no path whose graph is $Delta^0_2$
computability  mathematics 
7 weeks ago by beastaugh
What are the most attractive Turing undecidable problems in mathematics? - MathOverflow
computability  mathematics 
8 weeks ago by beastaugh
Creative and productive sets - Wikipedia
computability  arithmetic 
9 weeks ago by beastaugh
Computation in the limit - Wikipedia
computability 
10 weeks ago by beastaugh
Rice's theorem - Wikipedia
computability 
10 weeks ago by beastaugh
Alpha recursion theory - Wikipedia
computability 
10 weeks ago by beastaugh
Hyperarithmetical theory - Wikipedia
computability  arithmetic 
10 weeks ago by beastaugh
Reduction (recursion theory) - Wikipedia
computability 
11 weeks ago by beastaugh
FOM: what is computability theory?
computability 
11 weeks ago by beastaugh
FOM: renaming recursion theory
computability  humour  mathematics  harveyfriedman 
11 weeks ago by beastaugh
Recursive Functions (Stanford Encyclopedia of Philosophy)
computability  logic 
11 weeks ago by beastaugh
Computability and Complexity (Stanford Encyclopedia of Philosophy)
computability  complexity 
11 weeks ago by beastaugh
The Philosophy of Computer Science (Stanford Encyclopedia of Philosophy)
computability  philosophy  programming  compsci 
11 weeks ago by beastaugh
Computability theory - Wikipedia
computability 
11 weeks ago by beastaugh
[FOM] Intermediate Turing Degrees
computability 
11 weeks ago by beastaugh
FOM: priority arguments in applied recursion theory; proof cleansing
computability 
11 weeks ago by beastaugh
FOM: natural r.e. degrees; Pi01 classes
computability 
11 weeks ago by beastaugh
FOM: priority arguments; Kleene-r.e. degrees; Pi01 classes
computability 
11 weeks ago by beastaugh
[FOM] natural r.e. degrees
computability 
11 weeks ago by beastaugh
Many-one reduction - Wikipedia
computability 
11 weeks ago by beastaugh
Post's theorem - Wikipedia
computability  arithmetic 
11 weeks ago by beastaugh
Low (computability) - Wikipedia
computability 
12 weeks ago by beastaugh
Low basis theorem - Wikipedia
computability 
12 weeks ago by beastaugh
Turing jump - Wikipedia
computability  arithmetic 
12 weeks ago by beastaugh
Squeezing Church’s Thesis: Bringsjord and Sundar G. miss the point | Logic Matters
logic  computability  philosophyofmaths 
february 2012 by beastaugh
Showing a set Sigma^0_n subset of N is Sigma^0_n-complete
mathematics  computability 
february 2012 by beastaugh
Are total recursive functions recursively enumerable?
computability  mathematics 
february 2012 by beastaugh
Why do omega-models of subsystems of Z_2 satisfy full induction?
reversemathematics  arithmetic  modeltheory  computability 
february 2012 by beastaugh
[1201.4504] Is Turing's Thesis the Consequence of a More General Physical Principle?
computability  mathematics  turing 
january 2012 by beastaugh
Enumerating Permutations
haskell  mathematics  computability  combinatorics 
december 2011 by beastaugh
Scooping the Loop Snooper — Geoffrey K. Pullum
A proof that the Halting Problem is undecidable, in the style of Dr. Seuss.
computability  turing  poetry  humour  drseuss 
december 2011 by beastaugh
Obtaining Strong Recursion From Weak Recursion
mathematics  computability 
december 2011 by beastaugh
Universal Turing machine - Wikipedia
computability  turing  turingmachine  arithmetic 
december 2011 by beastaugh
Oracle machine - Wikipedia
computability  turing 
november 2011 by beastaugh
Function problem - Wikipedia
computability 
november 2011 by beastaugh
Turing degree - Wikipedia
computability 
november 2011 by beastaugh
Turing reduction - Wikipedia
computability 
november 2011 by beastaugh
Alan Turing - a Cambridge Scientific Mind
turing  mathematics  computability 
november 2011 by beastaugh
The Computability Menagerie
computability  logic 
november 2011 by beastaugh
[1110.1907] Relative to any non-hyperarithmetic set
arithmetic  computability  mathematics 
october 2011 by beastaugh
[1110.1864] Universal computably enumerable sets and initial segment prefix-free complexity
computability  mathematics 
october 2011 by beastaugh

Copy this bookmark:



description:


tags: