Hastily Scrawled Notes From Singularity Summit 2009

Technology: from stone to steel to silicon Hippocampus replacements happening now Upper limits on intelligence? Computability (NP-completeness), time, size and number of molecules in universe Technology and culture are intertwined (Stephenson's "feed" versus "seed") What if the Singularity has already happened multiple times over the life of the universe, and the current amount of non-dark ...

Машины мощнее машины Тьюринга

... the possibility of hypercomputation is not presented in textbooks or lectures. While there are exceptions to this (most notably brief presentations of O-machines), students still tend to finish their computer science education with a firm belief that the Turing machine has limits on its computation, but that it is as powerful (in terms of computability) as any other possible machine.

Rationality in Belarusian Thinking

... These conditions are studied within the most abstract sciences. All over the world, those sciences with the highest evidence are regarded as mathematical logic, foundations of mathematics, philosophical logic, computability theory, etc., but at the same time in the Soviet and post-Soviet cultures (in particular, in modern Belarus), they are considered as content-genetic logic, history of science,...

... yard that he is proud of. But I don't see these things when I see him at work, I see him as a org chart with a phone number, a set of skills, and an assessment of performance and computability to collaborate on projects. He is not a person. So, is there exceptions to this rule? Maybe we reveal every facet of ourself to certain people? I would imagine it takes a very, very large ego to do that ...

The book I could really do with for my Computability and Unsolvability module is nearly £50.

Computability theory and quantum computers...

QIP = PSPACE . Either that's pretty cool, or incomprehensible math speak. :). Edit: QIP and IP are related to theorem proving. Of course, the article uses "a problem instance is in the language", but if you consider theorems to be an exercise in string rewriting according to a grammar(which contains both the inference rules and axioms of the logic), that all makes sense. All "true" decidable ...

copmlexity and computability: ?????????????? ?????????????

всем привет! нам (20-ти студентам из Бар Илана, мадаей махшев) требуется ДЕЙСТВИТЕЛЬНО хороший преподаватель, который подготовит нас к экзаменам по двум предметам : complexity (сибухиют) и computability(хишувиют). Люди, если вы знаете таких преподавателей (только из личного опыта!!), плиз, дайте их контактные данные. Спасибо всем!!

???????????/???????????? ?????? ???????????/???????????????

После прочтения Сипсеровской «Теории вычислений» машины Тьюринга вошли в голову на столько глубоко, что я не могу воспринимать термины из теории вычислимых функций без перевода их на язык МТ. Вот цитата из «Вычислимых функций» Верещагина и Шеня: «Пусть U — произвольная главная универсальная функция. Тогда множество тех n, при которых функция U n является нигде не определенной, неразрешимо.» ...

??????? ?????

Охренительная статья про занятых бобров, функцию Аккермана, МТ с предсказателями и пр. После прочтения хочется сделать что-то гениальное :-). Who Can Name the Bigger Number?

Real Computation with Few Discrete Advice: A Complexity Theory of Nonuniform Computability. (arXiv:0

Real Computation with Few Discrete Advice: A Complexity Theory of Nonuniform Computability. (arXiv:0811.3782v1 [cs.CC]) It is folklore particularly in numerical and computer sciences ... real number computation show that such discrete advice can even make the difference between computability and uncomputability. We turn this into a both topological and combinatorial complexity theory of ...