Context-Dependent Deterministic Parallel Feedback Turing Computability

Update: 2015-12-23

Description

The limit of this kind of computability is the least ordinal which is \Pi_1 gap-reflecting on admissibles. If you would like to know what any of this means, come to the talk!

Comments

In Channel

Set theory and algebraic topology

2015-12-2357:56

Another proof of the Jayne-Rogers theorem

2015-12-2301:02:00

Borel Matchings and equidecompositions

2015-12-2359:07

Determinacy in Infinite Matroids

2015-12-2354:26

Pairwise Sums in the Reals

2015-12-2350:46

An Introduction to infinite matroids

2015-12-2357:28

Context-Dependent Deterministic Parallel Feedback Turing Computability

2015-12-2301:01:00

Long and short recursive constructions---cardinal invariants and parametrized diamonds

2015-12-2155:22

Computing beyond Constructibility: The Recognizability Strength of Ordinal Time Machines

2015-12-2157:43

Well-quasi-orderings for progam analysis and computational complextiy

2015-12-2101:00:00

Singularizing Cardinals and Square-like principles

2015-12-2101:04:00

On relating strong type theories and set theories

2015-12-2101:06:00

Inaccessible cardinals and accessible categories

2015-12-2158:31

The Pinning Down Number and Cardinal Arithmetic

2015-12-2154:07

A revision theory for type-free probability

2015-12-2101:03:00

Weihrauch degrees of determinacy

2015-12-2132:12

Infinite Matroids and Pushdown Automata on Infinite Words

2015-12-2131:31

Partition Relation Perspectives

2015-12-2142:41

Approximate Ramsey properties of Matrices

2015-12-2158:30

The unreasonable effectiveness of Nonstandard Analysis

2015-12-2139:40

00:00

Context-Dependent Deterministic Parallel Feedback Turing Computability

#box-pro-ellipsis-175748051409615{-webkit-line-clamp:2;}Context-Dependent Deterministic Parallel Feedback Turing Computability

Context-Dependent Deterministic Parallel Feedback Turing Computability

Vincenzo Abete

Context-Dependent Deterministic Parallel Feedback Turing Computability