Network profile

Ayrat

Reputation

936

2017
2018
2019
2020

Top tag

turing-machines

Next privilege

1,000 Rep.

See votes

Badges

Newest

Yearling

Next badge

15/30

Impact

2 posts edited

0 helpful flags

33 votes cast

18 Questions

Votes Activity Newest Views

votes

answer

16k

views

Memory Consistency vs Cache Coherence

Feb 14 '15 at 20:25 Wandering Logic 16.1k

votes

answer

727

views

Algorithm to translate a deterministic Büchi automaton to LTL (when possible)

logic automata linear-temporal-logic buchi-automata

Jul 14 '12 at 13:05 Gilles 'SO- stop being evil' 38k

votes

answers

views

What is the relation between First Order Logic and First Order Theory?

logic first-order-logic

Apr 26 '16 at 20:10 Andrej Bauer 23.6k

votes

answer

483

views

Exponential example for simplex used in SMT solvers

linear-programming smt-solvers

Oct 21 '17 at 15:38 Rodrigo de Azevedo 778

votes

answers

675

views

Intuitive explanation of Hoare assignment axiom

hoare-logic

Nov 22 '16 at 10:42 Ayrat 936

votes

answers

304

views

Metagame Paradox: what is wrong with this explanation?

computability turing-machines game-theory

Jun 16 at 12:57 Mike Rosoft 121

votes

answer

views

Is model checking PSpace-hard in formula size?

complexity-theory model-checking linear-temporal-logic parameterized-complexity

Apr 10 '19 at 15:38 DCTLib 2,487

votes

answers

121

views

Linear Temporal Logic with non-Boolean propositions (e.g. Integers)?

reference-request logic linear-temporal-logic

Jan 30 '19 at 7:50 Ayrat 936

votes

answers

views

Show a TM-recognizable language of TMs can be expressed by TM-description language of equivalent TMs

turing-machines computability decision-problem

Mar 15 '18 at 21:45 Louis 2,808

votes

answer

views

Why is the satisfiability of ESO formulas not equal to the satisfiability of FO formulas?

first-order-logic higher-order-logic

Mar 12 at 13:11 Noah Schweber 1,496

votes

answer

141

views

Is complexity class $\Sigma^1_1$ from polynomial hierarchy decidable?

complexity-theory complexity-classes

Apr 2 '18 at 20:43 Ariel 11.1k

votes

answer

169

views

Are there any LTL to _non_ deterministic Rabin automaton translators?

automata reference-request simulation linear-temporal-logic

Apr 11 '17 at 20:53 Community♦ 1

votes

answer

views

Can Nondet Rabin Tree automaton be determinized?

reference-request nondeterminism tree-automata

Mar 28 '17 at 13:00 David Richerby 77.2k

vote

answer

views

How were weights chosen in Runge-Kutta (4) method?

numerical-algorithms

Mar 29 at 22:33 Pseudonym 11.5k

vote

answer

views

Poly-time reductions for proving EXPTIME-hardness are _not_ enough?

complexity-theory time-complexity reductions

Jan 29 '19 at 18:46 David Richerby 77.2k

vote

answers

views

NP-hardness does not imply lower bound, strictly speaking?

complexity-theory reductions np-hard complexity-classes

Jan 19 '19 at 17:07 Discrete lizard♦ 5,639

vote

answers

views

Why every finite set is computable?

computability turing-machines

Jul 12 '13 at 5:55 Community♦ 1

votes

answers

views

Can numbers (not sets of numbers) in Linear Integer Arithmetic form a Boolean algebra?

boolean-algebra first-order-logic smt-solvers

Aug 8 at 10:37 Rodrigo de Azevedo 778

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

18 Questions

Memory Consistency vs Cache Coherence

Algorithm to translate a deterministic Büchi automaton to LTL (when possible)

What is the relation between First Order Logic and First Order Theory?

Exponential example for simplex used in SMT solvers

Intuitive explanation of Hoare assignment axiom

Metagame Paradox: what is wrong with this explanation?

Is model checking PSpace-hard in formula size?

Linear Temporal Logic with non-Boolean propositions (e.g. Integers)?

Show a TM-recognizable language of TMs can be expressed by TM-description language of equivalent TMs

Why is the satisfiability of ESO formulas not equal to the satisfiability of FO formulas?

Is complexity class $\Sigma^1_1$ from polynomial hierarchy decidable?

Are there any LTL to _non_ deterministic Rabin automaton translators?

Can Nondet Rabin Tree automaton be determinized?

How were weights chosen in Runge-Kutta (4) method?

Poly-time reductions for proving EXPTIME-hardness are _not_ enough?

NP-hardness does not imply lower bound, strictly speaking?

Why every finite set is computable?

Can numbers (not sets of numbers) in Linear Integer Arithmetic form a Boolean algebra?