Network profile

Gigili

Reputation

2,063

2.1k
1.8k
1.6k

2017
2018
2019
2020

Top tag

algorithms

Next privilege

2,500 Rep.

Create tag synonyms

Badges

Newest

Yearling

Next badge

0/1

Impact

1 post edited

1 helpful flag

59 votes cast

16 Questions

Votes Activity Newest Views

votes

answers

30k

views

The time complexity of finding the diameter of a graph

Jul 8 '17 at 18:34 Hans Hüttel 2,360

votes

answers

791

views

Is this finite graph problem decidable? What factors make a problem decidable?

algorithms computability graphs undecidability

Apr 30 '12 at 21:37 Kaveh 20.2k

votes

answers

10k

views

Are all context-free and regular languages efficiently decidable?

formal-languages regular-languages context-free efficiency

Sep 29 '15 at 19:51 Community♦ 1

votes

answer

views

Is an inﬁnite union of context-free languages always context-free?

formal-languages context-free closure-properties

Apr 25 '12 at 15:12 Patrick87 12k

votes

answers

views

A sufficient and necessary condition about regularity of a language

formal-languages regular-languages

Mar 15 '12 at 11:35 Raphael♦ 67.4k

votes

answers

views

A DFA for recognizing comments

formal-languages automata finite-automata compilers

Apr 6 '16 at 7:21 Miles 103

votes

answers

16k

views

Are Turing machines more powerful than pushdown automata?

formal-languages computability automata turing-machines pushdown-automata

Jan 16 '13 at 18:31 Community♦ 1

votes

answers

608

views

If a predicate is not computable, what can be said about its negation?

computability proof-techniques

Oct 23 '12 at 23:59 Gilles 'SO- stop being evil' 38k

votes

answer

671

views

Can every linear grammar be converted to Greibach form?

formal-languages formal-grammars

Mar 27 '12 at 3:09 Kaveh 20.2k

votes

answer

277

views

How to prove or disprove that f is computable?

computability proof-techniques

Oct 23 '12 at 18:10 Pål GD 7,645

votes

answer

667

views

How to show that f(x) is primitive recursive?

computability recursion

Oct 17 '12 at 13:37 Dave Clarke 19.3k

vote

answer

views

Sources on dictionary learning and related algorithms

algorithms reference-request image-processing

Dec 20 at 10:01 Community♦ 1

vote

answer

411

views

What factors must one consider choosing an NN structure?

artificial-intelligence neural-networks neural-computing

Jan 3 '13 at 6:58 AJed 2,312

votes

answer

views

What is the exact definition of a dictionary in the concept of linear algebra and computer science?

terminology image-processing linear-algebra

Feb 23 '15 at 7:10 Raphael♦ 67.4k

-1

votes

answers

271

views

Each of the two sets is recursively enumerable given their cartesian product is

computability enumeration

May 12 '13 at 17:47 Quinn Culver 141

-2

votes

answers

946

views

Does reachability belong to P?

complexity-theory graphs time-complexity

Feb 6 '14 at 7:39 Artem Kaznatcheev 4,582

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

16 Questions

The time complexity of finding the diameter of a graph

Is this finite graph problem decidable? What factors make a problem decidable?

Are all context-free and regular languages efficiently decidable?

Is an inﬁnite union of context-free languages always context-free?

A sufficient and necessary condition about regularity of a language

A DFA for recognizing comments

Are Turing machines more powerful than pushdown automata?

If a predicate is not computable, what can be said about its negation?

Can every linear grammar be converted to Greibach form?

How to prove or disprove that f is computable?

How to show that f(x) is primitive recursive?

Sources on dictionary learning and related algorithms

What factors must one consider choosing an NN structure?

What is the exact definition of a dictionary in the concept of linear algebra and computer science?

Each of the two sets is recursively enumerable given their cartesian product is

Does reachability belong to P?